./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/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_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/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_a05fba1d-f963-40f1-b38f-bcf1a183a132/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 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:45:50,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:45:50,452 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:45:50,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:45:50,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:45:50,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:45:50,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:45:50,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:45:50,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:45:50,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:45:50,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:45:50,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:45:50,537 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:45:50,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:45:50,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:45:50,541 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:45:50,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:45:50,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:45:50,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:45:50,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:45:50,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:45:50,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:45:50,546 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:45:50,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:45:50,547 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:45:50,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:45:50,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:45:50,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:45:50,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:45:50,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:45:50,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:45:50,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:45:50,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:45:50,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:45:50,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:45:50,555 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:45:50,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:45:50,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:45:50,556 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:45:50,557 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_a05fba1d-f963-40f1-b38f-bcf1a183a132/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_a05fba1d-f963-40f1-b38f-bcf1a183a132/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 -> 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 [2023-11-06 22:45:50,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:45:50,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:45:50,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:45:50,991 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:45:50,992 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:45:50,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2023-11-06 22:45:54,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:45:54,662 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:45:54,663 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2023-11-06 22:45:54,675 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/data/d39845432/7fb7ac01202a4ea78d8cc28abc837bd6/FLAGd74654e8a [2023-11-06 22:45:54,694 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/data/d39845432/7fb7ac01202a4ea78d8cc28abc837bd6 [2023-11-06 22:45:54,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:45:54,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:45:54,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:54,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:45:54,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:45:54,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:54" (1/1) ... [2023-11-06 22:45:54,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c4974e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:54, skipping insertion in model container [2023-11-06 22:45:54,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:54" (1/1) ... [2023-11-06 22:45:54,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:45:54,926 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_a05fba1d-f963-40f1-b38f-bcf1a183a132/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i[917,930] [2023-11-06 22:45:54,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:54,999 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:45:55,015 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_a05fba1d-f963-40f1-b38f-bcf1a183a132/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i[917,930] [2023-11-06 22:45:55,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:55,070 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:45:55,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55 WrapperNode [2023-11-06 22:45:55,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:55,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:55,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:45:55,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:45:55,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,143 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2023-11-06 22:45:55,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:55,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:45:55,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:45:55,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:45:55,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:45:55,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:45:55,199 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:45:55,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:45:55,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (1/1) ... [2023-11-06 22:45:55,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:45:55,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:55,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:45:55,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:45:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:45:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:45:55,322 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:45:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:45:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:45:55,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:45:55,465 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:45:55,467 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:45:55,904 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:45:55,916 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:45:55,917 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:45:55,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:55 BoogieIcfgContainer [2023-11-06 22:45:55,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:45:55,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:45:55,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:45:55,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:45:55,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:54" (1/3) ... [2023-11-06 22:45:55,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fed62de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:55, skipping insertion in model container [2023-11-06 22:45:55,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (2/3) ... [2023-11-06 22:45:55,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fed62de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:55, skipping insertion in model container [2023-11-06 22:45:55,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:55" (3/3) ... [2023-11-06 22:45:55,930 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-55.i [2023-11-06 22:45:55,950 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:45:55,951 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:45:56,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:45:56,032 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;@35978379, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:45:56,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:45:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:45:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 22:45:56,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:56,053 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:56,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:56,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:56,061 INFO L85 PathProgramCache]: Analyzing trace with hash 722886818, now seen corresponding path program 1 times [2023-11-06 22:45:56,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409055496] [2023-11-06 22:45:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:45:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:45:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:45:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:45:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:45:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:45:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:45:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:45:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:45:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:45:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:45:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:45:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:45:56,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409055496] [2023-11-06 22:45:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409055496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:56,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:56,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:45:56,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924819787] [2023-11-06 22:45:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:56,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:45:56,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:56,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:45:56,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:45:56,664 INFO L87 Difference]: Start difference. First operand has 58 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:45:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:56,727 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2023-11-06 22:45:56,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:45:56,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86 [2023-11-06 22:45:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:45:56,745 INFO L225 Difference]: With dead ends: 109 [2023-11-06 22:45:56,746 INFO L226 Difference]: Without dead ends: 54 [2023-11-06 22:45:56,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:45:56,762 INFO L413 NwaCegarLoop]: 78 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, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:45:56,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:45:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-06 22:45:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-06 22:45:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:45:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2023-11-06 22:45:56,845 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 86 [2023-11-06 22:45:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:45:56,847 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2023-11-06 22:45:56,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:45:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2023-11-06 22:45:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 22:45:56,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:56,860 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:56,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:45:56,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:56,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1284009558, now seen corresponding path program 1 times [2023-11-06 22:45:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655313380] [2023-11-06 22:45:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:45:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:45:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:45:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:45:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:45:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:45:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:45:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:45:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:45:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:45:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:45:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:45:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:45:57,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655313380] [2023-11-06 22:45:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655313380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:57,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:57,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:45:57,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323224965] [2023-11-06 22:45:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:57,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:45:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:57,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:45:57,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:45:57,288 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:45:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:57,351 INFO L93 Difference]: Finished difference Result 129 states and 187 transitions. [2023-11-06 22:45:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:45:57,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2023-11-06 22:45:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:45:57,356 INFO L225 Difference]: With dead ends: 129 [2023-11-06 22:45:57,356 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:45:57,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 22:45:57,359 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:45:57,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 144 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:45:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:45:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2023-11-06 22:45:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:45:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2023-11-06 22:45:57,382 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 86 [2023-11-06 22:45:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:45:57,387 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2023-11-06 22:45:57,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:45:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2023-11-06 22:45:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 22:45:57,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:57,398 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:57,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:45:57,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:57,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1025844120, now seen corresponding path program 1 times [2023-11-06 22:45:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:57,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005268142] [2023-11-06 22:45:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:45:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:45:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:45:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:45:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:45:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:45:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:45:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:45:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:45:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:45:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:45:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:45:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:45:57,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:57,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005268142] [2023-11-06 22:45:57,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005268142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:57,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:57,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:45:57,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732983724] [2023-11-06 22:45:57,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:57,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:45:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:57,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:45:57,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:45:57,701 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:45:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:57,796 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2023-11-06 22:45:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:45:57,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2023-11-06 22:45:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:45:57,800 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:45:57,800 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 22:45:57,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 22:45:57,807 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:45:57,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 129 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:45:57,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 22:45:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-06 22:45:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:45:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2023-11-06 22:45:57,824 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 86 [2023-11-06 22:45:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:45:57,825 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2023-11-06 22:45:57,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:45:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2023-11-06 22:45:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:45:57,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:57,828 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:57,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:45:57,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:57,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:57,829 INFO L85 PathProgramCache]: Analyzing trace with hash -533198653, now seen corresponding path program 1 times [2023-11-06 22:45:57,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:57,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678289307] [2023-11-06 22:45:57,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:57,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:45:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:45:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:45:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:45:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:45:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:45:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:45:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:45:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:45:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:45:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:45:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:45:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:45:58,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:58,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678289307] [2023-11-06 22:45:58,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678289307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:58,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:58,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:45:58,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452365688] [2023-11-06 22:45:58,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:58,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:45:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:45:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:45:58,734 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:45:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:59,004 INFO L93 Difference]: Finished difference Result 160 states and 229 transitions. [2023-11-06 22:45:59,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:45:59,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-06 22:45:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:45:59,008 INFO L225 Difference]: With dead ends: 160 [2023-11-06 22:45:59,008 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:45:59,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:45:59,010 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 98 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:45:59,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 189 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:45:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:45:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2023-11-06 22:45:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:45:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-11-06 22:45:59,041 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 88 [2023-11-06 22:45:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:45:59,042 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-11-06 22:45:59,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:45:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-11-06 22:45:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:45:59,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:45:59,045 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:59,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:45:59,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:45:59,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash -668060225, now seen corresponding path program 1 times [2023-11-06 22:45:59,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:59,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234269741] [2023-11-06 22:45:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:59,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:46:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:46:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:46:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:46:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:46:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:46:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:46:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:46:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:46:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:46:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:46:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:46:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:46:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:00,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234269741] [2023-11-06 22:46:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234269741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:00,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:00,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626466361] [2023-11-06 22:46:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:00,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:00,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:00,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:00,155 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:46:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:00,361 INFO L93 Difference]: Finished difference Result 186 states and 263 transitions. [2023-11-06 22:46:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:46:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-06 22:46:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:00,365 INFO L225 Difference]: With dead ends: 186 [2023-11-06 22:46:00,366 INFO L226 Difference]: Without dead ends: 134 [2023-11-06 22:46:00,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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 22:46:00,372 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:00,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 179 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:46:00,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-06 22:46:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 119. [2023-11-06 22:46:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:46:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2023-11-06 22:46:00,424 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 88 [2023-11-06 22:46:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:00,427 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2023-11-06 22:46:00,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:46:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2023-11-06 22:46:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:46:00,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:00,437 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:00,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:46:00,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:00,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:00,439 INFO L85 PathProgramCache]: Analyzing trace with hash 851377347, now seen corresponding path program 1 times [2023-11-06 22:46:00,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:00,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937719505] [2023-11-06 22:46:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:00,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:00,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:00,603 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:46:00,604 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:46:00,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:46:00,610 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 22:46:00,615 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:46:00,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:46:00 BoogieIcfgContainer [2023-11-06 22:46:00,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:46:00,748 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:46:00,748 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:46:00,749 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:46:00,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:55" (3/4) ... [2023-11-06 22:46:00,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:46:00,753 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:46:00,754 INFO L158 Benchmark]: Toolchain (without parser) took 6054.69ms. Allocated memory was 151.0MB in the beginning and 247.5MB in the end (delta: 96.5MB). Free memory was 103.6MB in the beginning and 187.7MB in the end (delta: -84.1MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2023-11-06 22:46:00,755 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 151.0MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:46:00,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.55ms. Allocated memory is still 151.0MB. Free memory was 103.3MB in the beginning and 90.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:46:00,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.56ms. Allocated memory is still 151.0MB. Free memory was 90.7MB in the beginning and 88.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:00,759 INFO L158 Benchmark]: Boogie Preprocessor took 53.24ms. Allocated memory is still 151.0MB. Free memory was 88.0MB in the beginning and 86.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:00,759 INFO L158 Benchmark]: RCFGBuilder took 720.77ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 86.5MB in the beginning and 172.9MB in the end (delta: -86.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2023-11-06 22:46:00,760 INFO L158 Benchmark]: TraceAbstraction took 4825.33ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 172.2MB in the beginning and 188.8MB in the end (delta: -16.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2023-11-06 22:46:00,760 INFO L158 Benchmark]: Witness Printer took 5.54ms. Allocated memory is still 247.5MB. Free memory was 188.8MB in the beginning and 187.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:00,767 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.36ms. Allocated memory is still 151.0MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.55ms. Allocated memory is still 151.0MB. Free memory was 103.3MB in the beginning and 90.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.56ms. Allocated memory is still 151.0MB. Free memory was 90.7MB in the beginning and 88.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.24ms. Allocated memory is still 151.0MB. Free memory was 88.0MB in the beginning and 86.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 720.77ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 86.5MB in the beginning and 172.9MB in the end (delta: -86.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4825.33ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 172.2MB in the beginning and 188.8MB in the end (delta: -16.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Witness Printer took 5.54ms. Allocated memory is still 247.5MB. Free memory was 188.8MB in the beginning and 187.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of shiftRight at line 60, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] double var_1_7 = 256.75; [L26] double var_1_8 = 63.5; [L27] double var_1_9 = 1.8; [L28] double var_1_10 = 0.25; [L29] double var_1_11 = 16.5; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] float var_1_15 = 4.6; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; VAL [isInitial=0, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] last_1_var_1_12 = var_1_12 [L94] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=9/5] [L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=9/5] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L86] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L87] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L87] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L88] var_1_18 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L89] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L90] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L90] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L105] RET updateVariables() [L106] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L44] COND FALSE !(stepLocal_1 && var_1_5) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=508, var_1_9=507] [L54] COND TRUE \read(var_1_2) [L55] var_1_7 = (((var_1_8 + var_1_9) + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L60] EXPR -4 >> var_1_1 VAL [-4 >> var_1_1=-5, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [-4 >> var_1_1=-5, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L60] EXPR -4 >> var_1_1 VAL [-4 >> var_1_1=-5, -4 >> var_1_1=-5, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [(((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)=-5, -4 >> var_1_1=-5, -4 >> var_1_1=-5, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=-1, stepLocal_3=-5, var_1_10=506, var_1_11=505, var_1_12=-5, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L62] COND FALSE !((~ var_1_17) <= stepLocal_3) [L67] var_1_12 = (var_1_17 - var_1_14) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=-1, stepLocal_3=-5, var_1_10=506, var_1_11=505, var_1_12=-125, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-125, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L97-L98] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((float) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-125, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=506, var_1_11=505, var_1_12=-125, var_1_14=127, var_1_15=508, var_1_16=127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=508, var_1_9=507] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 719 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 363 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 356 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=5, InterpolantAutomatonStates: 17, 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, 5 MinimizatonAttempts, 47 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1320/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:46:00,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/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_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/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_a05fba1d-f963-40f1-b38f-bcf1a183a132/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 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:46:03,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:46:04,137 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:46:04,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:46:04,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:46:04,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:46:04,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:46:04,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:46:04,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:46:04,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:46:04,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:46:04,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:46:04,215 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:46:04,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:46:04,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:46:04,219 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:46:04,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:46:04,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:46:04,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:46:04,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:46:04,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:46:04,223 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:46:04,223 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:46:04,224 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:46:04,224 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:46:04,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:46:04,225 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:46:04,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:46:04,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:46:04,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:46:04,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:04,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:46:04,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:46:04,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:46:04,230 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:46:04,231 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:46:04,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:46:04,231 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:46:04,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:46:04,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:46:04,233 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:46:04,234 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:46:04,234 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_a05fba1d-f963-40f1-b38f-bcf1a183a132/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_a05fba1d-f963-40f1-b38f-bcf1a183a132/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 -> 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 [2023-11-06 22:46:04,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:46:04,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:46:04,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:46:04,778 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:46:04,779 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:46:04,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2023-11-06 22:46:08,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:46:08,560 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:46:08,560 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2023-11-06 22:46:08,576 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/data/7d1a51f0f/7ab902b1dd2f4685aa479fa6d9f55edd/FLAG5e5905855 [2023-11-06 22:46:08,593 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/data/7d1a51f0f/7ab902b1dd2f4685aa479fa6d9f55edd [2023-11-06 22:46:08,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:46:08,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:46:08,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:08,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:46:08,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:46:08,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:08" (1/1) ... [2023-11-06 22:46:08,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebb8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:08, skipping insertion in model container [2023-11-06 22:46:08,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:08" (1/1) ... [2023-11-06 22:46:08,660 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:46:08,841 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_a05fba1d-f963-40f1-b38f-bcf1a183a132/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i[917,930] [2023-11-06 22:46:08,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:08,927 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:46:08,963 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_a05fba1d-f963-40f1-b38f-bcf1a183a132/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i[917,930] [2023-11-06 22:46:09,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:09,067 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:46:09,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09 WrapperNode [2023-11-06 22:46:09,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:09,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:09,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:46:09,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:46:09,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,175 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2023-11-06 22:46:09,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:09,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:46:09,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:46:09,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:46:09,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:46:09,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:46:09,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:46:09,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:46:09,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (1/1) ... [2023-11-06 22:46:09,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:09,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:09,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:46:09,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:46:09,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:46:09,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:46:09,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:46:09,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:46:09,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:46:09,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:46:09,582 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:46:09,585 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:46:12,242 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:46:12,251 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:46:12,251 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:46:12,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:12 BoogieIcfgContainer [2023-11-06 22:46:12,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:46:12,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:46:12,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:46:12,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:46:12,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:46:08" (1/3) ... [2023-11-06 22:46:12,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605a6db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:12, skipping insertion in model container [2023-11-06 22:46:12,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:09" (2/3) ... [2023-11-06 22:46:12,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605a6db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:12, skipping insertion in model container [2023-11-06 22:46:12,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:12" (3/3) ... [2023-11-06 22:46:12,266 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-55.i [2023-11-06 22:46:12,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:46:12,291 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:46:12,351 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:12,359 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;@4031290c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:12,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:46:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:46:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-06 22:46:12,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:12,380 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:12,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:12,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash 620519901, now seen corresponding path program 1 times [2023-11-06 22:46:12,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:46:12,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866440000] [2023-11-06 22:46:12,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:12,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:46:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:46:12,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:46:12,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:46:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:13,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:46:13,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:46:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-11-06 22:46:13,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:46:13,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:46:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866440000] [2023-11-06 22:46:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866440000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:13,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542341069] [2023-11-06 22:46:13,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:13,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:46:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:46:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:46:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:46:13,141 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:46:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:13,178 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions. [2023-11-06 22:46:13,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:46:13,180 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2023-11-06 22:46:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:13,192 INFO L225 Difference]: With dead ends: 85 [2023-11-06 22:46:13,192 INFO L226 Difference]: Without dead ends: 42 [2023-11-06 22:46:13,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:46:13,202 INFO L413 NwaCegarLoop]: 59 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, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:13,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:46:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-06 22:46:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-06 22:46:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:46:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2023-11-06 22:46:13,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 81 [2023-11-06 22:46:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:13,261 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-11-06 22:46:13,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:46:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2023-11-06 22:46:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-06 22:46:13,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:13,267 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:13,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-06 22:46:13,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/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 22:46:13,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:13,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1532144597, now seen corresponding path program 1 times [2023-11-06 22:46:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:46:13,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889486577] [2023-11-06 22:46:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:13,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:46:13,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:46:13,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:46:13,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/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 (3)] Waiting until timeout for monitored process [2023-11-06 22:46:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:14,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:46:14,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:46:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:46:14,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:46:14,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:46:14,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889486577] [2023-11-06 22:46:14,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889486577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:14,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:14,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:14,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980649578] [2023-11-06 22:46:14,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:14,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:46:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:14,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:14,126 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:46:16,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:46:18,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:46:20,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:46:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:46:20,397 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2023-11-06 22:46:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:20,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2023-11-06 22:46:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:46:20,428 INFO L225 Difference]: With dead ends: 93 [2023-11-06 22:46:20,428 INFO L226 Difference]: Without dead ends: 54 [2023-11-06 22:46:20,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 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 22:46:20,431 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:46:20,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 106 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2023-11-06 22:46:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-06 22:46:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2023-11-06 22:46:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:46:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2023-11-06 22:46:20,445 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 81 [2023-11-06 22:46:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:46:20,448 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-11-06 22:46:20,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:46:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2023-11-06 22:46:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-06 22:46:20,452 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:20,453 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:20,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/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 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:46:20,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/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 22:46:20,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:20,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash -987815337, now seen corresponding path program 1 times [2023-11-06 22:46:20,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:46:20,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11497179] [2023-11-06 22:46:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:20,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:46:20,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:46:20,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:46:20,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a05fba1d-f963-40f1-b38f-bcf1a183a132/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 (4)] Waiting until timeout for monitored process [2023-11-06 22:46:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:21,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 22:46:21,179 INFO L285 TraceCheckSpWp]: Computing forward predicates...