./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.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_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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_fb860a42-e5fd-4263-a50d-01170f81777b/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 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:34:49,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:34:49,442 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:34:49,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:34:49,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:34:49,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:34:49,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:34:49,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:34:49,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:34:49,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:34:49,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:34:49,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:34:49,520 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:34:49,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:34:49,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:34:49,523 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:34:49,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:34:49,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:34:49,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:34:49,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:34:49,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:34:49,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:34:49,527 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:34:49,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:34:49,528 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:34:49,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:34:49,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:34:49,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:34:49,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:34:49,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:34:49,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:34:49,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:34:49,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:34:49,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:34:49,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:34:49,535 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:34:49,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:34:49,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:34:49,536 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:34:49,536 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_fb860a42-e5fd-4263-a50d-01170f81777b/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_fb860a42-e5fd-4263-a50d-01170f81777b/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 -> 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 [2023-11-06 22:34:49,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:34:49,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:34:49,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:34:49,881 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:34:49,882 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:34:49,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2023-11-06 22:34:53,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:34:53,841 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:34:53,842 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2023-11-06 22:34:53,861 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/data/1deea5f67/c94cc847ca984db49990b483a8bd614e/FLAGa45fda8df [2023-11-06 22:34:53,886 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/data/1deea5f67/c94cc847ca984db49990b483a8bd614e [2023-11-06 22:34:53,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:34:53,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:34:53,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:34:53,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:34:53,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:34:53,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:34:53" (1/1) ... [2023-11-06 22:34:53,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c327e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:53, skipping insertion in model container [2023-11-06 22:34:53,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:34:53" (1/1) ... [2023-11-06 22:34:53,966 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:34:54,193 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_fb860a42-e5fd-4263-a50d-01170f81777b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i[916,929] [2023-11-06 22:34:54,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:34:54,285 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:34:54,299 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_fb860a42-e5fd-4263-a50d-01170f81777b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i[916,929] [2023-11-06 22:34:54,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:34:54,375 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:34:54,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54 WrapperNode [2023-11-06 22:34:54,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:34:54,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:34:54,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:34:54,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:34:54,386 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:34:54" (1/1) ... [2023-11-06 22:34:54,404 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:34:54" (1/1) ... [2023-11-06 22:34:54,473 INFO L138 Inliner]: procedures = 29, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2023-11-06 22:34:54,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:34:54,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:34:54,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:34:54,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:34:54,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (1/1) ... [2023-11-06 22:34:54,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (1/1) ... [2023-11-06 22:34:54,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (1/1) ... [2023-11-06 22:34:54,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (1/1) ... [2023-11-06 22:34:54,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (1/1) ... [2023-11-06 22:34:54,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (1/1) ... [2023-11-06 22:34:54,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (1/1) ... [2023-11-06 22:34:54,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (1/1) ... [2023-11-06 22:34:54,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:34:54,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:34:54,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:34:54,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:34:54,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (1/1) ... [2023-11-06 22:34:54,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:34:54,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:54,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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:34:54,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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:34:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:34:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:34:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:34:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:34:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:34:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:34:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:34:54,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:34:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:34:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:34:54,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:34:54,781 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:34:54,783 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:34:55,633 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:34:55,647 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:34:55,647 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:34:55,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:34:55 BoogieIcfgContainer [2023-11-06 22:34:55,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:34:55,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:34:55,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:34:55,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:34:55,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:34:53" (1/3) ... [2023-11-06 22:34:55,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bbf7264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:34:55, skipping insertion in model container [2023-11-06 22:34:55,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:54" (2/3) ... [2023-11-06 22:34:55,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bbf7264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:34:55, skipping insertion in model container [2023-11-06 22:34:55,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:34:55" (3/3) ... [2023-11-06 22:34:55,669 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-25.i [2023-11-06 22:34:55,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:34:55,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:34:55,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:34:55,775 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;@45f291a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:34:55,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:34:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:34:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:34:55,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:55,817 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:55,818 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:34:55,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1046836043, now seen corresponding path program 1 times [2023-11-06 22:34:55,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:55,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17421963] [2023-11-06 22:34:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:34:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:34:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:34:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:34:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:34:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:34:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:34:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:34:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:34:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:34:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:34:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:34:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:34:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:34:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:34:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:34:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:34:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:34:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:34:56,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:56,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17421963] [2023-11-06 22:34:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17421963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:56,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:56,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:34:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600867723] [2023-11-06 22:34:56,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:56,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:34:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:34:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:34:56,488 INFO L87 Difference]: Start difference. First operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:34:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:56,573 INFO L93 Difference]: Finished difference Result 241 states and 378 transitions. [2023-11-06 22:34:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:34:56,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2023-11-06 22:34:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:56,593 INFO L225 Difference]: With dead ends: 241 [2023-11-06 22:34:56,594 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 22:34:56,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:34:56,605 INFO L413 NwaCegarLoop]: 176 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, 176 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:34:56,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 22:34:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-06 22:34:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:34:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2023-11-06 22:34:56,695 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2023-11-06 22:34:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:56,696 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2023-11-06 22:34:56,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:34:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2023-11-06 22:34:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:34:56,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:56,710 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:56,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:34:56,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:34:56,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash -437863509, now seen corresponding path program 1 times [2023-11-06 22:34:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:56,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050530654] [2023-11-06 22:34:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:34:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:34:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:34:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:34:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:34:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:34:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:34:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:34:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:34:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:34:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:34:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:34:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:34:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:59,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:34:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:59,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:34:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:34:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:34:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:34:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:34:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:59,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050530654] [2023-11-06 22:34:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050530654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:59,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:59,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:34:59,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170456550] [2023-11-06 22:34:59,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:59,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:34:59,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:59,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:34:59,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:34:59,051 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:34:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:59,735 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2023-11-06 22:34:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:34:59,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2023-11-06 22:34:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:59,740 INFO L225 Difference]: With dead ends: 315 [2023-11-06 22:34:59,740 INFO L226 Difference]: Without dead ends: 198 [2023-11-06 22:34:59,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:34:59,744 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 102 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:59,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 492 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:34:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-06 22:34:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2023-11-06 22:34:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 164 states have (on average 1.396341463414634) internal successors, (229), 165 states have internal predecessors, (229), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:34:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 285 transitions. [2023-11-06 22:34:59,778 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 285 transitions. Word has length 144 [2023-11-06 22:34:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:59,779 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 285 transitions. [2023-11-06 22:34:59,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:34:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 285 transitions. [2023-11-06 22:34:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:34:59,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:59,783 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:59,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:34:59,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:34:59,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1659383948, now seen corresponding path program 1 times [2023-11-06 22:34:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:59,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129370936] [2023-11-06 22:34:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:35:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:35:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:35:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:35:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:35:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:35:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:35:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:35:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:35:02,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:02,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129370936] [2023-11-06 22:35:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129370936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:02,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:02,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:35:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244598641] [2023-11-06 22:35:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:02,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:02,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:02,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:02,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:02,130 INFO L87 Difference]: Start difference. First operand 195 states and 285 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:35:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:03,177 INFO L93 Difference]: Finished difference Result 419 states and 613 transitions. [2023-11-06 22:35:03,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:35:03,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2023-11-06 22:35:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:03,182 INFO L225 Difference]: With dead ends: 419 [2023-11-06 22:35:03,182 INFO L226 Difference]: Without dead ends: 227 [2023-11-06 22:35:03,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:35:03,196 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 164 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:03,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 822 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:35:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-06 22:35:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 197. [2023-11-06 22:35:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 166 states have (on average 1.391566265060241) internal successors, (231), 167 states have internal predecessors, (231), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:35:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2023-11-06 22:35:03,254 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 144 [2023-11-06 22:35:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:03,256 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2023-11-06 22:35:03,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:35:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2023-11-06 22:35:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-06 22:35:03,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:03,263 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:03,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:35:03,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:03,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash 254005952, now seen corresponding path program 1 times [2023-11-06 22:35:03,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:03,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398605160] [2023-11-06 22:35:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:03,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:35:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:35:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:35:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:35:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:35:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:35:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:35:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:35:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:35:04,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:04,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398605160] [2023-11-06 22:35:04,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398605160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:04,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:04,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:35:04,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754111477] [2023-11-06 22:35:04,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:04,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:04,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:04,359 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:35:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:05,226 INFO L93 Difference]: Finished difference Result 457 states and 667 transitions. [2023-11-06 22:35:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:35:05,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2023-11-06 22:35:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:05,232 INFO L225 Difference]: With dead ends: 457 [2023-11-06 22:35:05,232 INFO L226 Difference]: Without dead ends: 263 [2023-11-06 22:35:05,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:35:05,239 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 193 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:05,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 581 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:35:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-11-06 22:35:05,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 227. [2023-11-06 22:35:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 187 states have (on average 1.374331550802139) internal successors, (257), 188 states have internal predecessors, (257), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:35:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 329 transitions. [2023-11-06 22:35:05,282 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 329 transitions. Word has length 145 [2023-11-06 22:35:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:05,283 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 329 transitions. [2023-11-06 22:35:05,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:35:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 329 transitions. [2023-11-06 22:35:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-06 22:35:05,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:05,286 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:05,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:35:05,287 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:05,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -765919482, now seen corresponding path program 1 times [2023-11-06 22:35:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084696893] [2023-11-06 22:35:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:05,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:35:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:35:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:35:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:35:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:35:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:35:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:35:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:35:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:35:05,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084696893] [2023-11-06 22:35:05,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084696893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:05,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:05,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220540762] [2023-11-06 22:35:05,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:05,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:05,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:05,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:05,585 INFO L87 Difference]: Start difference. First operand 227 states and 329 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:35:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:05,694 INFO L93 Difference]: Finished difference Result 511 states and 745 transitions. [2023-11-06 22:35:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:35:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-11-06 22:35:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:05,702 INFO L225 Difference]: With dead ends: 511 [2023-11-06 22:35:05,702 INFO L226 Difference]: Without dead ends: 287 [2023-11-06 22:35:05,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:35:05,706 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 93 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:05,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 745 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-11-06 22:35:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 231. [2023-11-06 22:35:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 192 states have internal predecessors, (261), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:35:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 333 transitions. [2023-11-06 22:35:05,766 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 333 transitions. Word has length 146 [2023-11-06 22:35:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:05,767 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 333 transitions. [2023-11-06 22:35:05,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:35:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 333 transitions. [2023-11-06 22:35:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:35:05,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:05,772 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:05,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:35:05,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:05,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash 804611275, now seen corresponding path program 1 times [2023-11-06 22:35:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131262585] [2023-11-06 22:35:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:05,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:35:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:35:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:35:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:35:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:35:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:35:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:35:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:35:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:35:06,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:06,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131262585] [2023-11-06 22:35:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131262585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:06,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:06,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:35:06,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834299755] [2023-11-06 22:35:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:06,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:06,774 INFO L87 Difference]: Start difference. First operand 231 states and 333 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:35:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:07,516 INFO L93 Difference]: Finished difference Result 461 states and 665 transitions. [2023-11-06 22:35:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:07,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2023-11-06 22:35:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:07,521 INFO L225 Difference]: With dead ends: 461 [2023-11-06 22:35:07,522 INFO L226 Difference]: Without dead ends: 233 [2023-11-06 22:35:07,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:35:07,525 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 172 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:07,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 676 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:35:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-06 22:35:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2023-11-06 22:35:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 184 states have (on average 1.358695652173913) internal successors, (250), 185 states have internal predecessors, (250), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:35:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 322 transitions. [2023-11-06 22:35:07,572 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 322 transitions. Word has length 148 [2023-11-06 22:35:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:07,576 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 322 transitions. [2023-11-06 22:35:07,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:35:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 322 transitions. [2023-11-06 22:35:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:35:07,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:07,579 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:07,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:35:07,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:07,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1438403970, now seen corresponding path program 1 times [2023-11-06 22:35:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325081212] [2023-11-06 22:35:07,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:35:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:35:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:35:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:35:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:35:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:35:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:35:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:35:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:35:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325081212] [2023-11-06 22:35:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325081212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:09,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:09,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:09,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791552807] [2023-11-06 22:35:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:09,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:09,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:09,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:09,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:09,335 INFO L87 Difference]: Start difference. First operand 224 states and 322 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:35:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:09,922 INFO L93 Difference]: Finished difference Result 445 states and 639 transitions. [2023-11-06 22:35:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2023-11-06 22:35:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:09,928 INFO L225 Difference]: With dead ends: 445 [2023-11-06 22:35:09,928 INFO L226 Difference]: Without dead ends: 224 [2023-11-06 22:35:09,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:09,933 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 116 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:09,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 524 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:35:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-06 22:35:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2023-11-06 22:35:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 183 states have internal predecessors, (246), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:35:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 318 transitions. [2023-11-06 22:35:09,980 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 318 transitions. Word has length 148 [2023-11-06 22:35:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:09,981 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 318 transitions. [2023-11-06 22:35:09,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:35:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 318 transitions. [2023-11-06 22:35:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:35:09,985 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:09,985 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:09,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:35:09,986 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:09,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1739038669, now seen corresponding path program 1 times [2023-11-06 22:35:09,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:09,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018660623] [2023-11-06 22:35:09,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:35:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:35:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:35:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:35:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:35:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:35:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:35:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:35:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:35:10,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:10,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018660623] [2023-11-06 22:35:10,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018660623] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:35:10,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354370696] [2023-11-06 22:35:10,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:10,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:10,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:10,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:35:10,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:35:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:11,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:35:11,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:11,213 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2023-11-06 22:35:11,267 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:35:11,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 18 [2023-11-06 22:35:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 113 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:35:11,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:35:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:35:11,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354370696] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:35:11,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:35:11,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2023-11-06 22:35:11,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133118889] [2023-11-06 22:35:11,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:35:11,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:35:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:35:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:35:11,601 INFO L87 Difference]: Start difference. First operand 222 states and 318 transitions. Second operand has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 5 states have call successors, (21) [2023-11-06 22:35:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:13,353 INFO L93 Difference]: Finished difference Result 585 states and 828 transitions. [2023-11-06 22:35:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:35:13,355 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 5 states have call successors, (21) Word has length 148 [2023-11-06 22:35:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:13,359 INFO L225 Difference]: With dead ends: 585 [2023-11-06 22:35:13,359 INFO L226 Difference]: Without dead ends: 366 [2023-11-06 22:35:13,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 324 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:35:13,362 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 629 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:13,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 453 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:35:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-11-06 22:35:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 349. [2023-11-06 22:35:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 286 states have (on average 1.3426573426573427) internal successors, (384), 288 states have internal predecessors, (384), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 22:35:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 492 transitions. [2023-11-06 22:35:13,448 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 492 transitions. Word has length 148 [2023-11-06 22:35:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:13,450 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 492 transitions. [2023-11-06 22:35:13,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 5 states have call successors, (21) [2023-11-06 22:35:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 492 transitions. [2023-11-06 22:35:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-06 22:35:13,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:13,454 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:13,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:35:13,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:35:13,673 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:13,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash -361307625, now seen corresponding path program 1 times [2023-11-06 22:35:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61266641] [2023-11-06 22:35:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:35:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:35:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:35:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:35:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:35:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:35:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:35:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:35:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:35:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:14,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61266641] [2023-11-06 22:35:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61266641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:14,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:14,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:35:14,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948994670] [2023-11-06 22:35:14,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:14,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:14,464 INFO L87 Difference]: Start difference. First operand 349 states and 492 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:35:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:15,118 INFO L93 Difference]: Finished difference Result 871 states and 1234 transitions. [2023-11-06 22:35:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:35:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2023-11-06 22:35:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:15,123 INFO L225 Difference]: With dead ends: 871 [2023-11-06 22:35:15,123 INFO L226 Difference]: Without dead ends: 525 [2023-11-06 22:35:15,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:35:15,127 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 198 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:15,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 577 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:35:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-11-06 22:35:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 467. [2023-11-06 22:35:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 398 states have (on average 1.3618090452261307) internal successors, (542), 402 states have internal predecessors, (542), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-06 22:35:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 658 transitions. [2023-11-06 22:35:15,217 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 658 transitions. Word has length 149 [2023-11-06 22:35:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:15,221 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 658 transitions. [2023-11-06 22:35:15,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:35:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 658 transitions. [2023-11-06 22:35:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-06 22:35:15,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:15,225 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:15,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:35:15,225 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:15,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:15,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1058095520, now seen corresponding path program 1 times [2023-11-06 22:35:15,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:15,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176456595] [2023-11-06 22:35:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:15,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:35:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:15,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:35:15,466 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:35:15,467 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:35:15,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:35:15,473 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:15,497 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:35:15,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:35:15 BoogieIcfgContainer [2023-11-06 22:35:15,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:35:15,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:35:15,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:35:15,604 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:35:15,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:34:55" (3/4) ... [2023-11-06 22:35:15,607 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:35:15,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:35:15,609 INFO L158 Benchmark]: Toolchain (without parser) took 21716.57ms. Allocated memory was 186.6MB in the beginning and 419.4MB in the end (delta: 232.8MB). Free memory was 155.1MB in the beginning and 378.3MB in the end (delta: -223.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2023-11-06 22:35:15,609 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 130.0MB. Free memory was 83.1MB in the beginning and 82.9MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:15,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.61ms. Allocated memory is still 186.6MB. Free memory was 155.1MB in the beginning and 138.6MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:35:15,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.10ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 134.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:35:15,611 INFO L158 Benchmark]: Boogie Preprocessor took 76.49ms. Allocated memory is still 186.6MB. Free memory was 134.4MB in the beginning and 131.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:15,611 INFO L158 Benchmark]: RCFGBuilder took 1100.08ms. Allocated memory is still 186.6MB. Free memory was 131.0MB in the beginning and 99.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-06 22:35:15,612 INFO L158 Benchmark]: TraceAbstraction took 19945.90ms. Allocated memory was 186.6MB in the beginning and 419.4MB in the end (delta: 232.8MB). Free memory was 98.7MB in the beginning and 378.3MB in the end (delta: -279.6MB). Peak memory consumption was 154.3MB. Max. memory is 16.1GB. [2023-11-06 22:35:15,612 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 419.4MB. Free memory is still 378.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:15,614 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.35ms. Allocated memory is still 130.0MB. Free memory was 83.1MB in the beginning and 82.9MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.61ms. Allocated memory is still 186.6MB. Free memory was 155.1MB in the beginning and 138.6MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.10ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 134.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.49ms. Allocated memory is still 186.6MB. Free memory was 134.4MB in the beginning and 131.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1100.08ms. Allocated memory is still 186.6MB. Free memory was 131.0MB in the beginning and 99.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19945.90ms. Allocated memory was 186.6MB in the beginning and 419.4MB in the end (delta: 232.8MB). Free memory was 98.7MB in the beginning and 378.3MB in the end (delta: -279.6MB). Peak memory consumption was 154.3MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 419.4MB. Free memory is still 378.3MB. There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 256, 0, 10, 500, 0, 1509114200, 10, 128.9, 63.363, 4.575, 25.5, 1, 0, 1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L90] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=257, WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00.var_1_2=257, WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=257, WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00.var_1_2=257, WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=65538, WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00.var_1_3=65538, WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=65538, WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00.var_1_3=65538, WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=1, WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00.var_1_4=1, WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=1, WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00.var_1_4=1, WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=1073741823, WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00.var_1_5=1073741823, WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=1073741823, WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00.var_1_5=1073741823, WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=-3221225473, WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00.var_1_6=-3221225473, WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=-3221225473, WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00.var_1_6=-3221225473, WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ulong() [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=6, WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00.var_1_7=6, WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=6, WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00.var_1_7=6, WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00.var_1_9=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )=1, WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F=1, WrapperStruct00.var_1_9=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )=1, WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F=1, WrapperStruct00.var_1_9=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_10=1509114210, WrapperStruct00={4:0}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )=1, WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F=1, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_10=1509114210, WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )=1, WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F=1, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_10=1509114210, WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00.var_1_13=513, WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00.var_1_13=513, WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00.var_1_13=513, WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00.var_1_13=513, WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=-255, WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00.var_1_14=-255, WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=-255, WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00.var_1_14=-255, WrapperStruct00={4:0}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L58] EXPR WrapperStruct00.var_1_9 [L58] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L58] COND FALSE !(WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) [L65] EXPR WrapperStruct00.var_1_14 [L65] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_14 [L67] EXPR WrapperStruct00.var_1_3 [L67] unsigned short int stepLocal_0 = WrapperStruct00.var_1_3; [L68] WrapperStruct00.var_1_12 VAL [WrapperStruct00.var_1_12=-255, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2] [L68] COND TRUE WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=1, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2] [L69] COND FALSE !(stepLocal_0 <= WrapperStruct00.var_1_4) [L75] EXPR WrapperStruct00.var_1_1 [L75] unsigned long int stepLocal_1 = WrapperStruct00.var_1_1; [L76] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=6, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2, stepLocal_1=256] [L76] COND FALSE !(WrapperStruct00.var_1_7 >= stepLocal_1) [L79] EXPR WrapperStruct00.var_1_9 [L79] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2, stepLocal_1=256] [L79] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L79] EXPR WrapperStruct00.var_1_9 [L79] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)=1509114215, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_9=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2, stepLocal_1=256] [L79] WrapperStruct00.var_1_8 = ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))) [L81] EXPR WrapperStruct00.var_1_10 [L81] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2, stepLocal_1=256] [L81] EXPR ((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9) VAL [((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)=5127/40, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2, stepLocal_1=256] [L81] EXPR WrapperStruct00.var_1_8 VAL [((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)=5127/40, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_8=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2, stepLocal_1=256] [L81] EXPR ((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8) [L81] EXPR WrapperStruct00.var_1_8 [L81] EXPR ((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8) VAL [((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)=1509114215, ((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)=5127/40, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_8=1509114215, WrapperStruct00.var_1_8=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2, stepLocal_1=256] [L81] COND TRUE WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8))) [L82] EXPR WrapperStruct00.var_1_10 [L82] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_10 [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00.var_1_12=-255, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7)) [L122] EXPR WrapperStruct00.var_1_3 [L122] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1 VAL [(WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1=1, WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7)) VAL [(WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1=1, WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) [L122] EXPR WrapperStruct00.var_1_7 [L122] EXPR WrapperStruct00.var_1_1 VAL [(WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))=1, (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1=1, WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_1=256, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00.var_1_7=6, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) [L122] EXPR WrapperStruct00.var_1_8 [L122] EXPR WrapperStruct00.var_1_9 [L122] EXPR WrapperStruct00.var_1_10 VAL [(WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))=1, (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1=1, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_1=256, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00.var_1_7=6, WrapperStruct00.var_1_8=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L122] EXPR WrapperStruct00.var_1_9 [L122] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)=1509114215, (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))=1, (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1=1, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_1=256, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00.var_1_7=6, WrapperStruct00.var_1_8=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) VAL [((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)=1509114215, (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))=1, (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1=1, (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))=0, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_1=256, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00.var_1_7=6, WrapperStruct00.var_1_8=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) VAL [((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)=1509114215, (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))=0, (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1=1, (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))=0, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_1=256, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00.var_1_7=6, WrapperStruct00.var_1_8=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1)) VAL [((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))=0, ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)=1509114215, (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))=0, (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1=1, (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))=0, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_1=256, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00.var_1_7=6, WrapperStruct00.var_1_8=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))) && ((WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) VAL [(((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))) && ((WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)))=0, ((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))=0, ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)=1509114215, (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))=0, (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1=1, (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))=0, WrapperStruct00.var_1_10=1509114210, WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=-255, WrapperStruct00.var_1_1=256, WrapperStruct00.var_1_3=65538, WrapperStruct00.var_1_4=1, WrapperStruct00.var_1_7=6, WrapperStruct00.var_1_8=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00.var_1_9=1509114215, WrapperStruct00={4:0}, isInitial=1] [L122-L123] return (((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))) && ((WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1706 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1667 mSDsluCounter, 5046 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3550 mSDsCounter, 253 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3298 IncrementalHoareTripleChecker+Invalid, 3551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 253 mSolverCounterUnsat, 1496 mSDtfsCounter, 3298 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 684 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=467occurred in iteration=9, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 211 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 1615 NumberOfCodeBlocks, 1615 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1601 ConstructedInterpolants, 0 QuantifiedInterpolants, 4370 SizeOfPredicates, 7 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 6723/6732 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:35:15,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:35:18,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:35:18,719 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:35:18,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:35:18,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:35:18,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:35:18,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:35:18,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:35:18,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:35:18,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:35:18,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:35:18,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:35:18,772 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:35:18,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:35:18,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:35:18,776 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:35:18,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:35:18,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:35:18,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:35:18,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:35:18,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:35:18,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:35:18,781 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:35:18,782 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:35:18,782 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:35:18,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:35:18,783 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:35:18,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:35:18,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:35:18,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:35:18,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:18,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:35:18,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:35:18,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:35:18,788 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:35:18,789 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:35:18,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:35:18,790 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:35:18,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:35:18,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:35:18,792 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:35:18,792 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:35:18,793 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_fb860a42-e5fd-4263-a50d-01170f81777b/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_fb860a42-e5fd-4263-a50d-01170f81777b/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 -> 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 [2023-11-06 22:35:19,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:35:19,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:35:19,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:35:19,313 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:35:19,314 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:35:19,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2023-11-06 22:35:22,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:35:23,203 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:35:23,203 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2023-11-06 22:35:23,220 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/data/ddc8e2ff1/7171a7737ee94f3c97c6ef2255b24b78/FLAGa62ce22cb [2023-11-06 22:35:23,245 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/data/ddc8e2ff1/7171a7737ee94f3c97c6ef2255b24b78 [2023-11-06 22:35:23,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:35:23,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:35:23,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:23,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:35:23,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:35:23,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534a111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23, skipping insertion in model container [2023-11-06 22:35:23,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,314 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:35:23,488 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_fb860a42-e5fd-4263-a50d-01170f81777b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i[916,929] [2023-11-06 22:35:23,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:23,584 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:35:23,601 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_fb860a42-e5fd-4263-a50d-01170f81777b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i[916,929] [2023-11-06 22:35:23,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:23,689 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:35:23,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23 WrapperNode [2023-11-06 22:35:23,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:23,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:23,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:35:23,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:35:23,700 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:35:23" (1/1) ... [2023-11-06 22:35:23,723 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:35:23" (1/1) ... [2023-11-06 22:35:23,793 INFO L138 Inliner]: procedures = 36, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2023-11-06 22:35:23,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:23,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:35:23,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:35:23,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:35:23,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:35:23,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:35:23,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:35:23,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:35:23,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (1/1) ... [2023-11-06 22:35:23,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:24,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:24,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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:35:24,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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:35:24,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:35:24,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:35:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:35:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:35:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:35:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:35:24,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:35:24,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:35:24,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:35:24,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:35:24,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:35:24,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:35:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:35:24,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:35:24,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:35:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:35:24,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:35:24,250 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:35:24,253 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:35:25,131 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:35:25,146 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:35:25,147 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:35:25,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:25 BoogieIcfgContainer [2023-11-06 22:35:25,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:35:25,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:35:25,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:35:25,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:35:25,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:23" (1/3) ... [2023-11-06 22:35:25,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71610a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:25, skipping insertion in model container [2023-11-06 22:35:25,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:23" (2/3) ... [2023-11-06 22:35:25,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71610a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:25, skipping insertion in model container [2023-11-06 22:35:25,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:25" (3/3) ... [2023-11-06 22:35:25,166 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-25.i [2023-11-06 22:35:25,192 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:35:25,192 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:35:25,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:35:25,308 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;@21a2054a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:35:25,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:35:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:35:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:35:25,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:25,342 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:25,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:25,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1167224636, now seen corresponding path program 1 times [2023-11-06 22:35:25,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:35:25,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737709093] [2023-11-06 22:35:25,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:25,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:25,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:35:25,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:35:25,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:35:25,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 139 [2023-11-06 22:35:25,862 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 22:35:25,871 INFO L158 Benchmark]: Toolchain (without parser) took 2615.43ms. Allocated memory is still 90.2MB. Free memory was 66.4MB in the beginning and 45.4MB in the end (delta: 20.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2023-11-06 22:35:25,872 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 39.2MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:25,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.75ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 48.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:35:25,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.86ms. Allocated memory is still 90.2MB. Free memory was 48.3MB in the beginning and 44.5MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:25,876 INFO L158 Benchmark]: Boogie Preprocessor took 182.47ms. Allocated memory is still 90.2MB. Free memory was 44.5MB in the beginning and 66.9MB in the end (delta: -22.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2023-11-06 22:35:25,878 INFO L158 Benchmark]: RCFGBuilder took 1174.11ms. Allocated memory is still 90.2MB. Free memory was 66.9MB in the beginning and 32.8MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-06 22:35:25,885 INFO L158 Benchmark]: TraceAbstraction took 714.11ms. Allocated memory is still 90.2MB. Free memory was 31.8MB in the beginning and 45.4MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:25,891 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.31ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 39.2MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.75ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 48.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.86ms. Allocated memory is still 90.2MB. Free memory was 48.3MB in the beginning and 44.5MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 182.47ms. Allocated memory is still 90.2MB. Free memory was 44.5MB in the beginning and 66.9MB in the end (delta: -22.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1174.11ms. Allocated memory is still 90.2MB. Free memory was 66.9MB in the beginning and 32.8MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 714.11ms. Allocated memory is still 90.2MB. Free memory was 31.8MB in the beginning and 45.4MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:35:25,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/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: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb860a42-e5fd-4263-a50d-01170f81777b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.