./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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_48913315-42d7-4931-8297-748cf2b17690/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 c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:11,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:11,431 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:14:11,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:11,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:11,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:11,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:11,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:11,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:11,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:11,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:11,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:11,487 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:11,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:11,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:14:11,489 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:11,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:11,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:11,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:11,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:14:11,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:11,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:14:11,492 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:11,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:14:11,494 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:11,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:11,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:11,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:11,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:11,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:11,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:11,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:14:11,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:14:11,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:14:11,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:11,499 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:14:11,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:11,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:11,499 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:11,499 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_48913315-42d7-4931-8297-748cf2b17690/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_48913315-42d7-4931-8297-748cf2b17690/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 -> c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e [2023-11-06 21:14:11,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:11,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:11,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:11,872 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:11,872 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:11,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i [2023-11-06 21:14:15,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:15,357 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:15,358 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i [2023-11-06 21:14:15,368 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/data/662b05837/45f511ba0489494abd3e0ab0a7490438/FLAGc0f73cf2d [2023-11-06 21:14:15,384 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/data/662b05837/45f511ba0489494abd3e0ab0a7490438 [2023-11-06 21:14:15,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:15,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:15,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:15,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:15,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:15,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:15,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e3f527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15, skipping insertion in model container [2023-11-06 21:14:15,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:15,458 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:15,630 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_48913315-42d7-4931-8297-748cf2b17690/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2023-11-06 21:14:15,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:15,749 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:15,759 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_48913315-42d7-4931-8297-748cf2b17690/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2023-11-06 21:14:15,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:15,829 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:15,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15 WrapperNode [2023-11-06 21:14:15,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:15,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:15,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:15,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:15,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:15,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:15,929 INFO L138 Inliner]: procedures = 29, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2023-11-06 21:14:15,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:15,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:15,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:15,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:15,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:15,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:15,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:15,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:16,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:16,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:16,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:16,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:16,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:16,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:16,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:16,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:16,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (1/1) ... [2023-11-06 21:14:16,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:16,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:16,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:16,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:16,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:16,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:14:16,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 21:14:16,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 21:14:16,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:14:16,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 21:14:16,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:14:16,169 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:14:16,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:16,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:16,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:16,351 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:16,356 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:17,003 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:17,012 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:17,013 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:14:17,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:17 BoogieIcfgContainer [2023-11-06 21:14:17,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:17,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:17,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:17,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:17,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:15" (1/3) ... [2023-11-06 21:14:17,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36629069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:17, skipping insertion in model container [2023-11-06 21:14:17,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:15" (2/3) ... [2023-11-06 21:14:17,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36629069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:17, skipping insertion in model container [2023-11-06 21:14:17,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:17" (3/3) ... [2023-11-06 21:14:17,036 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-11.i [2023-11-06 21:14:17,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:17,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:14:17,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:14:17,160 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;@2cc465ea, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:14:17,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:14:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 21:14:17,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:17,196 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:17,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:17,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2066617954, now seen corresponding path program 1 times [2023-11-06 21:14:17,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:17,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408582629] [2023-11-06 21:14:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:14:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408582629] [2023-11-06 21:14:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408582629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:17,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:17,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:14:17,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810898252] [2023-11-06 21:14:17,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:17,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:14:17,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:17,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:14:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:14:17,855 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 21:14:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:17,929 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2023-11-06 21:14:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:14:17,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2023-11-06 21:14:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:17,948 INFO L225 Difference]: With dead ends: 271 [2023-11-06 21:14:17,948 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 21:14:17,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 21:14:17,959 INFO L413 NwaCegarLoop]: 201 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, 201 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 21:14:17,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 21:14:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-06 21:14:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2023-11-06 21:14:18,042 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2023-11-06 21:14:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:18,043 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2023-11-06 21:14:18,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 21:14:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2023-11-06 21:14:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 21:14:18,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:18,055 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:18,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:14:18,056 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:18,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 394412294, now seen corresponding path program 1 times [2023-11-06 21:14:18,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:18,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81663535] [2023-11-06 21:14:18,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:14:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:18,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:18,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81663535] [2023-11-06 21:14:18,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81663535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:18,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:18,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:18,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356340666] [2023-11-06 21:14:18,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:18,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:18,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:18,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:18,727 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:18,835 INFO L93 Difference]: Finished difference Result 300 states and 449 transitions. [2023-11-06 21:14:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:18,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 21:14:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:18,844 INFO L225 Difference]: With dead ends: 300 [2023-11-06 21:14:18,844 INFO L226 Difference]: Without dead ends: 168 [2023-11-06 21:14:18,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:18,847 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 71 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:18,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 576 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:14:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-06 21:14:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2023-11-06 21:14:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2023-11-06 21:14:18,874 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2023-11-06 21:14:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:18,877 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2023-11-06 21:14:18,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2023-11-06 21:14:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 21:14:18,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:18,882 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:18,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:14:18,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:18,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:18,884 INFO L85 PathProgramCache]: Analyzing trace with hash 950244714, now seen corresponding path program 1 times [2023-11-06 21:14:18,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:18,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961798938] [2023-11-06 21:14:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:18,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:14:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:19,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961798938] [2023-11-06 21:14:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961798938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:19,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:14:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56832971] [2023-11-06 21:14:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:19,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:14:19,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:19,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:14:19,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:19,288 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:19,350 INFO L93 Difference]: Finished difference Result 295 states and 439 transitions. [2023-11-06 21:14:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:14:19,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-11-06 21:14:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:19,353 INFO L225 Difference]: With dead ends: 295 [2023-11-06 21:14:19,353 INFO L226 Difference]: Without dead ends: 161 [2023-11-06 21:14:19,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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 21:14:19,356 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 89 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:19,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 812 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-06 21:14:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2023-11-06 21:14:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 122 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2023-11-06 21:14:19,371 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 135 [2023-11-06 21:14:19,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:19,372 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2023-11-06 21:14:19,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2023-11-06 21:14:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 21:14:19,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:19,375 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:19,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:14:19,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:19,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash 110166840, now seen corresponding path program 1 times [2023-11-06 21:14:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:19,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444237217] [2023-11-06 21:14:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:14:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:19,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:19,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444237217] [2023-11-06 21:14:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444237217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:14:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013548768] [2023-11-06 21:14:19,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:19,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:14:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:14:19,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:19,719 INFO L87 Difference]: Start difference. First operand 140 states and 206 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:19,793 INFO L93 Difference]: Finished difference Result 348 states and 513 transitions. [2023-11-06 21:14:19,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:14:19,794 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2023-11-06 21:14:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:19,797 INFO L225 Difference]: With dead ends: 348 [2023-11-06 21:14:19,797 INFO L226 Difference]: Without dead ends: 211 [2023-11-06 21:14:19,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:14:19,799 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 120 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:19,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 847 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-06 21:14:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 141. [2023-11-06 21:14:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2023-11-06 21:14:19,814 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 136 [2023-11-06 21:14:19,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:19,815 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2023-11-06 21:14:19,816 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:19,816 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2023-11-06 21:14:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 21:14:19,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:19,822 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:19,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:14:19,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:19,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:19,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2106273212, now seen corresponding path program 1 times [2023-11-06 21:14:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:19,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500214533] [2023-11-06 21:14:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:14:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500214533] [2023-11-06 21:14:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500214533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:20,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:20,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:14:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881311971] [2023-11-06 21:14:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:20,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:14:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:14:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:20,101 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:20,152 INFO L93 Difference]: Finished difference Result 297 states and 438 transitions. [2023-11-06 21:14:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:14:20,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-11-06 21:14:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:20,155 INFO L225 Difference]: With dead ends: 297 [2023-11-06 21:14:20,155 INFO L226 Difference]: Without dead ends: 159 [2023-11-06 21:14:20,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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 21:14:20,157 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 97 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:20,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 754 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-06 21:14:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 144. [2023-11-06 21:14:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2023-11-06 21:14:20,168 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 137 [2023-11-06 21:14:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:20,169 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2023-11-06 21:14:20,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2023-11-06 21:14:20,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 21:14:20,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:20,172 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:20,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:14:20,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:20,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash -223779553, now seen corresponding path program 1 times [2023-11-06 21:14:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:20,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758194467] [2023-11-06 21:14:20,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:14:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758194467] [2023-11-06 21:14:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758194467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:20,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:14:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470114983] [2023-11-06 21:14:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:20,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:14:20,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:14:20,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:14:20,491 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:20,600 INFO L93 Difference]: Finished difference Result 337 states and 492 transitions. [2023-11-06 21:14:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:14:20,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-11-06 21:14:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:20,603 INFO L225 Difference]: With dead ends: 337 [2023-11-06 21:14:20,603 INFO L226 Difference]: Without dead ends: 196 [2023-11-06 21:14:20,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:14:20,606 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 125 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:20,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1012 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-06 21:14:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 145. [2023-11-06 21:14:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 127 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2023-11-06 21:14:20,628 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 137 [2023-11-06 21:14:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:20,629 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2023-11-06 21:14:20,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2023-11-06 21:14:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 21:14:20,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:20,633 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:20,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:14:20,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:20,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1720666045, now seen corresponding path program 1 times [2023-11-06 21:14:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672496967] [2023-11-06 21:14:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:14:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:14:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:14:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:14:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:14:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:20,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672496967] [2023-11-06 21:14:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672496967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:14:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326987567] [2023-11-06 21:14:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:20,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:14:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:20,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:14:20,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:14:20,782 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:20,817 INFO L93 Difference]: Finished difference Result 328 states and 477 transitions. [2023-11-06 21:14:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:14:20,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-11-06 21:14:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:20,820 INFO L225 Difference]: With dead ends: 328 [2023-11-06 21:14:20,820 INFO L226 Difference]: Without dead ends: 186 [2023-11-06 21:14:20,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:14:20,824 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 50 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:20,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 442 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-06 21:14:20,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 146. [2023-11-06 21:14:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.40625) internal successors, (180), 128 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2023-11-06 21:14:20,836 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 138 [2023-11-06 21:14:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:20,837 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2023-11-06 21:14:20,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2023-11-06 21:14:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 21:14:20,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:20,841 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:20,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:14:20,841 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:20,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:20,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1294437573, now seen corresponding path program 1 times [2023-11-06 21:14:20,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:20,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714197182] [2023-11-06 21:14:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:20,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:14:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:21,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:14:21,173 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:14:21,175 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:14:21,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:14:21,180 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:21,184 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:14:21,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:14:21 BoogieIcfgContainer [2023-11-06 21:14:21,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:14:21,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:14:21,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:14:21,313 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:14:21,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:17" (3/4) ... [2023-11-06 21:14:21,316 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:14:21,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:14:21,318 INFO L158 Benchmark]: Toolchain (without parser) took 5929.33ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 108.7MB in the beginning and 118.6MB in the end (delta: -9.9MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2023-11-06 21:14:21,318 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 144.7MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:14:21,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.36ms. Allocated memory is still 144.7MB. Free memory was 108.7MB in the beginning and 104.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:14:21,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.35ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 99.6MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 21:14:21,319 INFO L158 Benchmark]: Boogie Preprocessor took 125.28ms. Allocated memory is still 144.7MB. Free memory was 99.6MB in the beginning and 96.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:14:21,319 INFO L158 Benchmark]: RCFGBuilder took 944.37ms. Allocated memory is still 144.7MB. Free memory was 96.1MB in the beginning and 63.0MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-06 21:14:21,320 INFO L158 Benchmark]: TraceAbstraction took 4294.26ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 62.4MB in the beginning and 119.6MB in the end (delta: -57.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:14:21,320 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 182.5MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:14:21,322 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.26ms. Allocated memory is still 144.7MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.36ms. Allocated memory is still 144.7MB. Free memory was 108.7MB in the beginning and 104.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.35ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 99.6MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.28ms. Allocated memory is still 144.7MB. Free memory was 99.6MB in the beginning and 96.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 944.37ms. Allocated memory is still 144.7MB. Free memory was 96.1MB in the beginning and 63.0MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4294.26ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 62.4MB in the beginning and 119.6MB in the end (delta: -57.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 182.5MB. Free memory is still 118.6MB. 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 someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 1 }; [L25-L27] double double_Array_0[2] = { 7.675, 50.75 }; [L28-L30] float float_Array_0[3] = { 1000000.7, 32.5, 2.4 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -16 }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L37] unsigned char last_1_BOOL_unsigned_char_Array_0_2_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR BOOL_unsigned_char_Array_0[2] [L98] last_1_BOOL_unsigned_char_Array_0_2_ = BOOL_unsigned_char_Array_0[2] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=257, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=257, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=257, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=257, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-255, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-255, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-255, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-255, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] double_Array_0[0] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[0] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L77] EXPR double_Array_0[0] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=1000011, double_Array_0[0]=1000011, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [(double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=1000011, double_Array_0[0]=1000011, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [(double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=1000011, double_Array_0[0]=1000011, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] double_Array_0[1] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[1] [L79] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L79] EXPR double_Array_0[1] [L79] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1]=1000006, double_Array_0[1]=1000006, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [(double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F=1, double_Array_0[1]=1000006, double_Array_0[1]=1000006, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [(double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F=1, double_Array_0[1]=1000006, double_Array_0[1]=1000006, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] float_Array_0[0] = __VERIFIER_nondet_float() [L81] EXPR float_Array_0[0] [L81] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L81] EXPR float_Array_0[0] [L81] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=1000005, float_Array_0[0]=1000005, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [(float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F=1, float_Array_0[0]=1000005, float_Array_0[0]=1000005, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [(float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F=1, float_Array_0[0]=1000005, float_Array_0[0]=1000005, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] float_Array_0[2] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[2] [L83] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F [L83] EXPR float_Array_0[2] [L83] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[2]=1000002, float_Array_0[2]=1000002, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [(float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F=1, float_Array_0[2]=1000002, float_Array_0[2]=1000002, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] CALL assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] RET assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [(float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F=1, float_Array_0[2]=1000002, float_Array_0[2]=1000002, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, unsigned_char_Array_0={8:0}] [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, unsigned_char_Array_0={8:0}] [L87] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0][0]=510] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0][0]=510] [L89] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0][0]=510] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0][0]=510] [L90] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1][0]=-2] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1][0]=-2] [L92] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1][0]=-2] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1][0]=-2] [L93] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1][1]=254] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1][1]=254] [L95] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1][1]=254] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1][1]=254] [L109] RET updateVariables() [L110] CALL step() [L41] EXPR double_Array_0[0] [L41] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=1000011, double_Array_0[1]=1000006, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L41] COND FALSE !(double_Array_0[0] >= double_Array_0[1]) [L50] EXPR float_Array_0[1] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L50] COND FALSE !(float_Array_0[1] <= float_Array_0[1]) [L53] EXPR BOOL_unsigned_char_Array_0[2] [L53] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[2]; [L54] EXPR double_Array_0[1] [L54] EXPR float_Array_0[1] [L54] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}] [L54] COND FALSE !((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) [L63] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2]=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}] [L63] COND FALSE !(! BOOL_unsigned_char_Array_0[2]) [L66] EXPR unsigned_char_Array_0[0][0] [L66] unsigned_char_Array_0[0][1] = unsigned_char_Array_0[0][0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR double_Array_0[1] [L101] EXPR float_Array_0[1] [L101] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR ((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1 [L101] EXPR BOOL_unsigned_char_Array_0[2] [L101] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2] [L101] EXPR BOOL_unsigned_char_Array_0[2] [L101] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1 [L101] EXPR float_Array_0[1] [L101] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) [L101] EXPR signed_char_Array_0[1] [L101] EXPR signed_char_Array_0[0] [L101] EXPR (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [(float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, signed_char_Array_0[1]=-16, unsigned_char_Array_0={8:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1 VAL [(BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1=0, (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, signed_char_Array_0[1]=-16, unsigned_char_Array_0={8:0}] [L101] EXPR ((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1 VAL [((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1=0, (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1=0, (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, signed_char_Array_0[1]=-16, unsigned_char_Array_0={8:0}] [L101] EXPR (((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1) VAL [(((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)=0, ((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1=0, (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1=0, (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, signed_char_Array_0[1]=-16, unsigned_char_Array_0={8:0}] [L101] EXPR ((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1) VAL [((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)=0, (((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)=0, ((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1=0, (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1=0, (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, signed_char_Array_0[1]=-16, unsigned_char_Array_0={8:0}] [L101] EXPR (((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)) && ((! BOOL_unsigned_char_Array_0[2]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((((((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) < (unsigned_char_Array_0[1][0])) ? (((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) : (unsigned_char_Array_0[1][0]))))) : (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) VAL [(((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)) && ((! BOOL_unsigned_char_Array_0[2]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((((((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) < (unsigned_char_Array_0[1][0])) ? (((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) : (unsigned_char_Array_0[1][0]))))) : (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[0][0])))=0, ((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)=0, (((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)=0, ((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1=0, (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1=0, (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, BOOL_unsigned_char_Array_0[2]=1, double_Array_0={5:0}, double_Array_0[1]=1000006, float_Array_0={6:0}, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, float_Array_0[1]=65/2, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, signed_char_Array_0[0]=126, signed_char_Array_0[1]=-16, unsigned_char_Array_0={8:0}] [L101-L102] return (((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)) && ((! BOOL_unsigned_char_Array_0[2]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((((((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) < (unsigned_char_Array_0[1][0])) ? (((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) : (unsigned_char_Array_0[1][0]))))) : (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 552 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 4644 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3096 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1548 mSDtfsCounter, 151 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=7, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 228 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1087 NumberOfCodeBlocks, 1087 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 942 ConstructedInterpolants, 0 QuantifiedInterpolants, 964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 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 21:14:21,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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_48913315-42d7-4931-8297-748cf2b17690/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 c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:24,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:24,180 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:14:24,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:24,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:24,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:24,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:24,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:24,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:24,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:24,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:24,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:24,221 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:24,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:24,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:14:24,223 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:24,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:24,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:24,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:14:24,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:24,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:14:24,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:14:24,226 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:14:24,227 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:14:24,227 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:24,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:14:24,228 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:24,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:24,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:24,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:24,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:24,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:24,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:24,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:14:24,231 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:14:24,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:14:24,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:24,232 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:14:24,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:24,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:24,233 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:14:24,233 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:24,233 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_48913315-42d7-4931-8297-748cf2b17690/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_48913315-42d7-4931-8297-748cf2b17690/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 -> c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e [2023-11-06 21:14:24,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:24,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:24,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:24,623 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:24,627 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:24,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i [2023-11-06 21:14:27,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:28,209 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:28,210 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i [2023-11-06 21:14:28,222 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/data/2d9753fd0/2c9f9a0b613c4db48d27e21bf6666531/FLAG982c771cf [2023-11-06 21:14:28,240 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/data/2d9753fd0/2c9f9a0b613c4db48d27e21bf6666531 [2023-11-06 21:14:28,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:28,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:28,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:28,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:28,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:28,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aee68b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28, skipping insertion in model container [2023-11-06 21:14:28,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,305 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:28,525 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_48913315-42d7-4931-8297-748cf2b17690/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2023-11-06 21:14:28,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:28,655 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:28,673 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_48913315-42d7-4931-8297-748cf2b17690/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2023-11-06 21:14:28,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:28,776 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:28,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28 WrapperNode [2023-11-06 21:14:28,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:28,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:28,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:28,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:28,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,848 INFO L138 Inliner]: procedures = 33, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2023-11-06 21:14:28,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:28,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:28,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:28,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:28,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:28,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:28,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:28,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:28,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (1/1) ... [2023-11-06 21:14:28,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:28,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:28,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 21:14:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 21:14:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:14:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:14:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 21:14:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 21:14:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 21:14:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 21:14:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:14:29,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:14:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:29,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:14:29,189 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:29,192 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:39,524 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:39,540 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:39,540 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:14:39,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:39 BoogieIcfgContainer [2023-11-06 21:14:39,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:39,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:39,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:39,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:39,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:28" (1/3) ... [2023-11-06 21:14:39,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a50c2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:39, skipping insertion in model container [2023-11-06 21:14:39,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:28" (2/3) ... [2023-11-06 21:14:39,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a50c2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:39, skipping insertion in model container [2023-11-06 21:14:39,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:39" (3/3) ... [2023-11-06 21:14:39,559 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-11.i [2023-11-06 21:14:39,579 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:39,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:14:39,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:14:39,668 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;@3886bc14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:14:39,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:14:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 21:14:39,700 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:39,701 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:14:39,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:39,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2066617954, now seen corresponding path program 1 times [2023-11-06 21:14:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:14:39,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16997164] [2023-11-06 21:14:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:39,728 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 21:14:39,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:14:39,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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 21:14:39,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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 21:14:40,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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 [2023-11-06 21:14:40,122 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_48913315-42d7-4931-8297-748cf2b17690/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_48913315-42d7-4931-8297-748cf2b17690/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 21:14:40,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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)] Forceful destruction successful, exit code 139 [2023-11-06 21:14:40,129 INFO L158 Benchmark]: Toolchain (without parser) took 11878.94ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 38.7MB in the beginning and 45.4MB in the end (delta: -6.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,129 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 71.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:14:40,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.12ms. Allocated memory is still 71.3MB. Free memory was 38.5MB in the beginning and 41.7MB in the end (delta: -3.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.65ms. Allocated memory is still 71.3MB. Free memory was 41.7MB in the beginning and 37.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,131 INFO L158 Benchmark]: Boogie Preprocessor took 69.93ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 33.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,132 INFO L158 Benchmark]: RCFGBuilder took 10624.92ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 33.4MB in the beginning and 69.7MB in the end (delta: -36.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,133 INFO L158 Benchmark]: TraceAbstraction took 579.18ms. Allocated memory is still 96.5MB. Free memory was 69.2MB in the beginning and 45.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 21:14:40,137 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.22ms. Allocated memory is still 71.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.12ms. Allocated memory is still 71.3MB. Free memory was 38.5MB in the beginning and 41.7MB in the end (delta: -3.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.65ms. Allocated memory is still 71.3MB. Free memory was 41.7MB in the beginning and 37.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.93ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 33.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 10624.92ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 33.4MB in the beginning and 69.7MB in the end (delta: -36.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 579.18ms. Allocated memory is still 96.5MB. Free memory was 69.2MB in the beginning and 45.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. 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_48913315-42d7-4931-8297-748cf2b17690/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_48913315-42d7-4931-8297-748cf2b17690/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 21:14:40,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48913315-42d7-4931-8297-748cf2b17690/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_48913315-42d7-4931-8297-748cf2b17690/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.