./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c06336cb14a71e49257e9a1a6eb7bbafa15ea27e03c080926f8f56f04c062783 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:39:00,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:39:00,312 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:39:00,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:39:00,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:39:00,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:39:00,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:39:00,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:39:00,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:39:00,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:39:00,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:39:00,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:39:00,399 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:39:00,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:39:00,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:39:00,401 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:39:00,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:39:00,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:39:00,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:39:00,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:39:00,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:39:00,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:39:00,405 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:39:00,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:39:00,405 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:39:00,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:39:00,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:39:00,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:39:00,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:00,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:39:00,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:39:00,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:39:00,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:39:00,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:39:00,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:39:00,410 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:39:00,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:39:00,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:39:00,411 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:39:00,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c06336cb14a71e49257e9a1a6eb7bbafa15ea27e03c080926f8f56f04c062783 [2023-11-06 22:39:00,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:00,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:00,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:00,784 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:00,784 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:00,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2023-11-06 22:39:04,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:39:04,366 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:39:04,367 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2023-11-06 22:39:04,376 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/data/6cd6c66cc/2d51e088c51845e084ec693547d9aeb7/FLAGa96a70fd1 [2023-11-06 22:39:04,391 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/data/6cd6c66cc/2d51e088c51845e084ec693547d9aeb7 [2023-11-06 22:39:04,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:39:04,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:39:04,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:04,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:39:04,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:39:04,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171eb4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04, skipping insertion in model container [2023-11-06 22:39:04,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:04,665 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i[917,930] [2023-11-06 22:39:04,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:04,746 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:39:04,760 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i[917,930] [2023-11-06 22:39:04,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:04,830 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:39:04,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04 WrapperNode [2023-11-06 22:39:04,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:04,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:04,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:39:04,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:39:04,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,886 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-11-06 22:39:04,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:04,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:39:04,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:39:04,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:39:04,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:39:04,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:39:04,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:39:04,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:39:04,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (1/1) ... [2023-11-06 22:39:04,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:04,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:04,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:04,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:39:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:39:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:39:05,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:39:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:39:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:39:05,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:39:05,145 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:39:05,147 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:39:05,432 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:39:05,440 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:39:05,440 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:39:05,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:05 BoogieIcfgContainer [2023-11-06 22:39:05,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:39:05,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:39:05,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:39:05,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:39:05,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:39:04" (1/3) ... [2023-11-06 22:39:05,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cedc110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:05, skipping insertion in model container [2023-11-06 22:39:05,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04" (2/3) ... [2023-11-06 22:39:05,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cedc110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:05, skipping insertion in model container [2023-11-06 22:39:05,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:05" (3/3) ... [2023-11-06 22:39:05,453 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-90.i [2023-11-06 22:39:05,474 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:39:05,474 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:39:05,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:39:05,540 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3df4d505, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:39:05,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:39:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:39:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:39:05,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:05,566 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:05,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:05,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1039288057, now seen corresponding path program 1 times [2023-11-06 22:39:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305780817] [2023-11-06 22:39:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:05,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:05,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:39:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:05,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:39:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:39:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:39:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:39:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:39:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:39:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:39:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:39:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:39:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:39:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:39:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:39:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:39:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:39:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:39:06,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:06,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305780817] [2023-11-06 22:39:06,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305780817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:06,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:06,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:39:06,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830311293] [2023-11-06 22:39:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:06,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:39:06,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:06,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:39:06,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:39:06,178 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:39:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:06,210 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2023-11-06 22:39:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:39:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2023-11-06 22:39:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:06,221 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:39:06,222 INFO L226 Difference]: Without dead ends: 53 [2023-11-06 22:39:06,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:39:06,230 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:06,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-06 22:39:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-06 22:39:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:39:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2023-11-06 22:39:06,281 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 124 [2023-11-06 22:39:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:06,281 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2023-11-06 22:39:06,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:39:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2023-11-06 22:39:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:39:06,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:06,286 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:06,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:39:06,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:06,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:06,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1080942329, now seen corresponding path program 1 times [2023-11-06 22:39:06,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:06,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699807965] [2023-11-06 22:39:06,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:06,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:39:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:39:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:39:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:39:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:39:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:39:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:39:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:39:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:39:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:39:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:39:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:39:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:39:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:39:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:39:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:39:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699807965] [2023-11-06 22:39:14,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699807965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:14,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:39:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23909465] [2023-11-06 22:39:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:14,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:39:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:39:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:39:14,060 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:15,771 INFO L93 Difference]: Finished difference Result 140 states and 205 transitions. [2023-11-06 22:39:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:39:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-06 22:39:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:15,776 INFO L225 Difference]: With dead ends: 140 [2023-11-06 22:39:15,776 INFO L226 Difference]: Without dead ends: 138 [2023-11-06 22:39:15,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:39:15,778 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 133 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:15,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 576 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:39:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-06 22:39:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 86. [2023-11-06 22:39:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:39:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2023-11-06 22:39:15,846 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 124 [2023-11-06 22:39:15,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:15,849 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2023-11-06 22:39:15,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2023-11-06 22:39:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:39:15,858 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:15,859 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:15,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:39:15,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:15,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash -694065033, now seen corresponding path program 1 times [2023-11-06 22:39:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116448692] [2023-11-06 22:39:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:39:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:39:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:39:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:39:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:39:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:39:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:39:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:39:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:39:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:39:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:39:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:39:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:39:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:39:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:39:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:39:21,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:21,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116448692] [2023-11-06 22:39:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116448692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:21,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:21,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:39:21,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102258323] [2023-11-06 22:39:21,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:21,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:39:21,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:21,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:39:21,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:39:21,256 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:23,062 INFO L93 Difference]: Finished difference Result 193 states and 277 transitions. [2023-11-06 22:39:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:39:23,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-06 22:39:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:23,067 INFO L225 Difference]: With dead ends: 193 [2023-11-06 22:39:23,068 INFO L226 Difference]: Without dead ends: 191 [2023-11-06 22:39:23,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:39:23,070 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 132 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:23,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 493 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:39:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-06 22:39:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 82. [2023-11-06 22:39:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:39:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2023-11-06 22:39:23,103 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 124 [2023-11-06 22:39:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:23,104 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2023-11-06 22:39:23,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2023-11-06 22:39:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:39:23,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:23,107 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:23,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:39:23,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:23,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash -692217991, now seen corresponding path program 1 times [2023-11-06 22:39:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:23,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395537352] [2023-11-06 22:39:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:39:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:39:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:39:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:39:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:39:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:39:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:39:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:39:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:39:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:39:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:39:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:39:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:39:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:39:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:39:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:39:25,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:25,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395537352] [2023-11-06 22:39:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395537352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:39:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017360050] [2023-11-06 22:39:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:25,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:39:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:25,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:39:25,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:39:25,900 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:27,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:27,366 INFO L93 Difference]: Finished difference Result 144 states and 209 transitions. [2023-11-06 22:39:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:39:27,367 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-06 22:39:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:27,369 INFO L225 Difference]: With dead ends: 144 [2023-11-06 22:39:27,369 INFO L226 Difference]: Without dead ends: 142 [2023-11-06 22:39:27,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:39:27,371 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 116 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:27,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 564 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:39:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-06 22:39:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 80. [2023-11-06 22:39:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:39:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2023-11-06 22:39:27,477 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 124 [2023-11-06 22:39:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:27,478 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2023-11-06 22:39:27,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2023-11-06 22:39:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 22:39:27,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:27,495 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:27,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:39:27,495 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:27,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1163479113, now seen corresponding path program 1 times [2023-11-06 22:39:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:27,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672848413] [2023-11-06 22:39:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:39:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:39:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:39:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:39:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:39:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:39:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:39:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:39:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:39:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:39:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:39:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:39:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:39:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:39:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:39:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:39:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:32,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672848413] [2023-11-06 22:39:32,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672848413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:32,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:32,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:39:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595419165] [2023-11-06 22:39:32,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:32,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:39:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:32,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:39:32,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:39:32,081 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:34,863 INFO L93 Difference]: Finished difference Result 212 states and 297 transitions. [2023-11-06 22:39:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:39:34,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-06 22:39:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:34,867 INFO L225 Difference]: With dead ends: 212 [2023-11-06 22:39:34,867 INFO L226 Difference]: Without dead ends: 210 [2023-11-06 22:39:34,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:39:34,870 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 178 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:34,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 657 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:39:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-06 22:39:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 70. [2023-11-06 22:39:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:39:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2023-11-06 22:39:34,903 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 125 [2023-11-06 22:39:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:34,904 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2023-11-06 22:39:34,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2023-11-06 22:39:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 22:39:34,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:34,906 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:34,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:39:34,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:34,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:34,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1165326155, now seen corresponding path program 1 times [2023-11-06 22:39:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:34,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872239637] [2023-11-06 22:39:34,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:34,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:39:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:39:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:39:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:39:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:39:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:39:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:39:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:39:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:39:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:39:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:39:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:39:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:39:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:39:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:39:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:39:37,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:37,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872239637] [2023-11-06 22:39:37,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872239637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:37,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:37,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:39:37,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148957733] [2023-11-06 22:39:37,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:37,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:39:37,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:37,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:39:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:39:37,481 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:40,917 INFO L93 Difference]: Finished difference Result 217 states and 305 transitions. [2023-11-06 22:39:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 22:39:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-06 22:39:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:40,924 INFO L225 Difference]: With dead ends: 217 [2023-11-06 22:39:40,924 INFO L226 Difference]: Without dead ends: 215 [2023-11-06 22:39:40,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:39:40,926 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 191 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:40,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 664 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:39:40,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-06 22:39:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 67. [2023-11-06 22:39:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:39:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2023-11-06 22:39:40,958 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 125 [2023-11-06 22:39:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:40,959 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2023-11-06 22:39:40,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2023-11-06 22:39:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 22:39:40,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:40,961 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:40,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:39:40,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:40,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash 354132487, now seen corresponding path program 1 times [2023-11-06 22:39:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:40,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695754687] [2023-11-06 22:39:40,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:39:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:39:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:39:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:39:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:39:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:39:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:39:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:39:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:39:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:39:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:39:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:39:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:39:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:39:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:39:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:39:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:39:44,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695754687] [2023-11-06 22:39:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695754687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:44,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:44,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:39:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279040955] [2023-11-06 22:39:44,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:44,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:39:44,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:39:44,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:39:44,449 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:46,120 INFO L93 Difference]: Finished difference Result 146 states and 210 transitions. [2023-11-06 22:39:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:39:46,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-06 22:39:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:46,121 INFO L225 Difference]: With dead ends: 146 [2023-11-06 22:39:46,121 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:39:46,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:39:46,124 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 142 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:46,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 453 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:39:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:39:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:39:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:39:46,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2023-11-06 22:39:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:46,126 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:39:46,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:39:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:39:46,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:39:46,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:39:46,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:39:46,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:39:55,648 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-11-06 22:39:55,649 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-11-06 22:39:55,649 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-06 22:39:55,649 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:39:55,649 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:39:55,649 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (and (= ~var_1_8~0 ~var_1_6~0) (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (let ((.cse0 (* (div ~var_1_6~0 4294967296) 4294967296))) (or (= ~var_1_16~0 ~var_1_15~0) (< (+ ~var_1_7~0 .cse0) (+ (* (div ~var_1_7~0 4294967296) 4294967296) ~var_1_6~0)) (< (+ .cse0 ~var_1_15~0) (+ ~var_1_6~0 (* (div ~var_1_15~0 4294967296) 4294967296) 1))))) [2023-11-06 22:39:55,649 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 114 125) the Hoare annotation is: false [2023-11-06 22:39:55,650 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-11-06 22:39:55,650 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-11-06 22:39:55,650 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-11-06 22:39:55,650 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-06 22:39:55,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:39:55,650 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,650 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,650 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-11-06 22:39:55,650 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 42 72) no Hoare annotation was computed. [2023-11-06 22:39:55,650 INFO L899 garLoopResultBuilder]: For program point L103(lines 73 104) no Hoare annotation was computed. [2023-11-06 22:39:55,651 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,651 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,651 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-06 22:39:55,651 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-06 22:39:55,651 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:39:55,651 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-11-06 22:39:55,651 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-11-06 22:39:55,651 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2023-11-06 22:39:55,651 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-06 22:39:55,651 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-06 22:39:55,652 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 109) no Hoare annotation was computed. [2023-11-06 22:39:55,652 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-06 22:39:55,652 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,652 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,652 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2023-11-06 22:39:55,652 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:39:55,652 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-11-06 22:39:55,652 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-11-06 22:39:55,652 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:39:55,653 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-06 22:39:55,654 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 110 113) the Hoare annotation is: (and (= ~var_1_8~0 ~var_1_6~0) (let ((.cse19 (+ ~var_1_4~0 ~var_1_3~0)) (.cse15 (* (div ~var_1_5~0 65536) 65536))) (let ((.cse13 (= (+ .cse15 65536 ~var_1_1~0) ~var_1_5~0)) (.cse17 (< .cse19 ~var_1_5~0)) (.cse18 (* 65536 (div .cse19 65536)))) (let ((.cse6 (= (* (div ~var_1_2~0 256) 256) ~var_1_2~0)) (.cse21 (= (+ 65536 .cse18 ~var_1_1~0) .cse19)) (.cse20 (+ .cse18 32768)) (.cse14 (or .cse13 .cse17)) (.cse9 (= (* 256 (div ~var_1_12~0 256)) ~var_1_12~0))) (let ((.cse4 (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0)) (.cse3 (not .cse9)) (.cse8 (= ~var_1_10~0 0)) (.cse0 (or (not .cse21) (and (<= .cse20 .cse19) .cse14))) (.cse10 (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0)) (.cse1 (= ~var_1_10~0 1)) (.cse2 (not (= |ULTIMATE.start_property_#res#1| 0))) (.cse5 (let ((.cse31 (<= ~var_1_15~0 (+ 255 ~var_1_3~0))) (.cse30 (* (div ~var_1_3~0 65536) 65536))) (let ((.cse26 (<= ~var_1_3~0 (+ .cse30 32767))) (.cse27 (and .cse31 (= ~var_1_3~0 (+ .cse30 ~var_1_14~0)))) (.cse25 (and .cse31 (= ~var_1_3~0 (+ .cse30 65536 ~var_1_14~0)))) (.cse23 (<= (+ .cse30 32768) ~var_1_3~0)) (.cse28 (<= (+ 256 ~var_1_3~0) ~var_1_15~0)) (.cse22 (* 65536 (div (+ (- 256) ~var_1_15~0) 65536)))) (or (and (<= (+ .cse22 33024) ~var_1_15~0) (let ((.cse24 (and .cse28 (= (+ 65792 .cse22 ~var_1_14~0) ~var_1_15~0)))) (or (and .cse23 (or .cse24 .cse25)) (and .cse26 (or .cse27 .cse24))))) (and (<= ~var_1_15~0 (+ .cse22 33023)) (let ((.cse29 (and .cse28 (= (+ .cse22 256 ~var_1_14~0) ~var_1_15~0)))) (or (and .cse26 (or .cse29 .cse27)) (and (or .cse29 .cse25) .cse23)))))))) (.cse7 (or (let ((.cse12 (< .cse19 .cse20))) (and (or (and (or .cse12 .cse13) .cse14) (< ~var_1_5~0 (+ .cse15 32768))) (or (< (+ .cse15 32767) ~var_1_5~0) (let ((.cse16 (= (+ .cse15 ~var_1_1~0) ~var_1_5~0))) (and (or .cse16 .cse17) (or .cse12 .cse16)))) (or (= (+ .cse18 ~var_1_1~0) .cse19) (< ~var_1_5~0 (+ ~var_1_4~0 ~var_1_3~0 1))))) .cse21)) (.cse11 (not .cse6))) (or (and .cse0 .cse1 .cse2 (or .cse3 .cse4) .cse5 .cse6 .cse7) (and (not .cse4) .cse8 .cse2 .cse5 .cse6 .cse9) (and .cse10 .cse3 .cse8 .cse2 .cse5 .cse11) (and .cse0 (or .cse9 (not .cse10)) .cse1 .cse2 .cse5 .cse7 .cse11)))))) (let ((.cse32 (* (div ~var_1_6~0 4294967296) 4294967296))) (or (= ~var_1_16~0 ~var_1_15~0) (< (+ ~var_1_7~0 .cse32) (+ (* (div ~var_1_7~0 4294967296) 4294967296) ~var_1_6~0)) (< (+ .cse32 ~var_1_15~0) (+ ~var_1_6~0 (* (div ~var_1_15~0 4294967296) 4294967296) 1))))) [2023-11-06 22:39:55,654 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-11-06 22:39:55,654 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-11-06 22:39:55,654 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:39:55,654 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-06 22:39:55,654 INFO L899 garLoopResultBuilder]: For program point L58(lines 42 72) no Hoare annotation was computed. [2023-11-06 22:39:55,662 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,662 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,662 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 72) no Hoare annotation was computed. [2023-11-06 22:39:55,662 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-11-06 22:39:55,662 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 61) no Hoare annotation was computed. [2023-11-06 22:39:55,662 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,663 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,663 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:39:55,663 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-06 22:39:55,663 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-06 22:39:55,663 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:39:55,663 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:39:55,665 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:39:55,665 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:39:55,668 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:55,670 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:39:55,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:39:55 BoogieIcfgContainer [2023-11-06 22:39:55,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:39:55,751 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:39:55,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:39:55,752 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:39:55,752 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:05" (3/4) ... [2023-11-06 22:39:55,755 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:39:55,761 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:39:55,771 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 22:39:55,772 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:39:55,772 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:39:55,773 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:39:55,808 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((var_1_8 == var_1_6) && ((((((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (var_1_10 == 1)) && !((\result == 0))) && (!(((256 * (var_1_12 / 256)) == var_1_12)) || (((var_1_13 / 256) * 256) == var_1_13))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) || (((((!((((var_1_13 / 256) * 256) == var_1_13)) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((256 * (var_1_12 / 256)) == var_1_12))) || ((((((((var_1_11 / 256) * 256) == var_1_11) && !(((256 * (var_1_12 / 256)) == var_1_12))) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || (((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (((256 * (var_1_12 / 256)) == var_1_12) || !((((var_1_11 / 256) * 256) == var_1_11)))) && (var_1_10 == 1)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) && !((((var_1_2 / 256) * 256) == var_1_2))))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) [2023-11-06 22:39:55,852 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((var_1_8 == var_1_6) && ((((((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (var_1_10 == 1)) && !((\result == 0))) && (!(((256 * (var_1_12 / 256)) == var_1_12)) || (((var_1_13 / 256) * 256) == var_1_13))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) || (((((!((((var_1_13 / 256) * 256) == var_1_13)) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((256 * (var_1_12 / 256)) == var_1_12))) || ((((((((var_1_11 / 256) * 256) == var_1_11) && !(((256 * (var_1_12 / 256)) == var_1_12))) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || (((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (((256 * (var_1_12 / 256)) == var_1_12) || !((((var_1_11 / 256) * 256) == var_1_11)))) && (var_1_10 == 1)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) && !((((var_1_2 / 256) * 256) == var_1_2))))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) [2023-11-06 22:39:55,870 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:39:55,870 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:39:55,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:39:55,871 INFO L158 Benchmark]: Toolchain (without parser) took 51468.60ms. Allocated memory was 178.3MB in the beginning and 476.1MB in the end (delta: 297.8MB). Free memory was 147.4MB in the beginning and 347.2MB in the end (delta: -199.8MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. [2023-11-06 22:39:55,872 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:39:55,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.65ms. Allocated memory is still 178.3MB. Free memory was 147.4MB in the beginning and 134.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:39:55,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.25ms. Allocated memory is still 178.3MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:39:55,873 INFO L158 Benchmark]: Boogie Preprocessor took 32.67ms. Allocated memory is still 178.3MB. Free memory was 132.7MB in the beginning and 131.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:39:55,874 INFO L158 Benchmark]: RCFGBuilder took 521.47ms. Allocated memory is still 178.3MB. Free memory was 131.1MB in the beginning and 115.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:39:55,874 INFO L158 Benchmark]: TraceAbstraction took 50305.42ms. Allocated memory was 178.3MB in the beginning and 476.1MB in the end (delta: 297.8MB). Free memory was 114.9MB in the beginning and 352.4MB in the end (delta: -237.6MB). Peak memory consumption was 256.3MB. Max. memory is 16.1GB. [2023-11-06 22:39:55,874 INFO L158 Benchmark]: Witness Printer took 119.27ms. Allocated memory is still 476.1MB. Free memory was 352.4MB in the beginning and 347.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:39:55,878 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.65ms. Allocated memory is still 178.3MB. Free memory was 147.4MB in the beginning and 134.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.25ms. Allocated memory is still 178.3MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.67ms. Allocated memory is still 178.3MB. Free memory was 132.7MB in the beginning and 131.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.47ms. Allocated memory is still 178.3MB. Free memory was 131.1MB in the beginning and 115.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 50305.42ms. Allocated memory was 178.3MB in the beginning and 476.1MB in the end (delta: 297.8MB). Free memory was 114.9MB in the beginning and 352.4MB in the end (delta: -237.6MB). Peak memory consumption was 256.3MB. Max. memory is 16.1GB. * Witness Printer took 119.27ms. Allocated memory is still 476.1MB. Free memory was 352.4MB in the beginning and 347.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.2s, OverallIterations: 7, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 3486 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2545 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2043 IncrementalHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 941 mSDtfsCounter, 2043 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=2, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 511 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 92 PreInvPairs, 151 NumberOfFragments, 1436 HoareAnnotationTreeSize, 92 FomulaSimplifications, 3002087 FormulaSimplificationTreeSizeReduction, 6.9s HoareSimplificationTime, 25 FomulaSimplificationsInter, 17855 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 871 NumberOfCodeBlocks, 871 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 6160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 5320/5320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((var_1_8 == var_1_6) && ((((((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (var_1_10 == 1)) && !((\result == 0))) && (!(((256 * (var_1_12 / 256)) == var_1_12)) || (((var_1_13 / 256) * 256) == var_1_13))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) || (((((!((((var_1_13 / 256) * 256) == var_1_13)) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((256 * (var_1_12 / 256)) == var_1_12))) || ((((((((var_1_11 / 256) * 256) == var_1_11) && !(((256 * (var_1_12 / 256)) == var_1_12))) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || (((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (((256 * (var_1_12 / 256)) == var_1_12) || !((((var_1_11 / 256) * 256) == var_1_11)))) && (var_1_10 == 1)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) && !((((var_1_2 / 256) * 256) == var_1_2))))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (var_1_8 == var_1_6) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((var_1_8 == var_1_6) && !((cond == 0))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:39:55,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d030c4ff-0fc4-42e3-a554-db1d95252441/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE