./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.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_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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_934ad1b2-c85f-453a-97f4-14abfff7c503/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 fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:27:56,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:27:56,278 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:27:56,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:27:56,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:27:56,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:27:56,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:27:56,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:27:56,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:27:56,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:27:56,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:27:56,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:27:56,352 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:27:56,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:27:56,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:27:56,354 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:27:56,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:27:56,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:27:56,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:27:56,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:27:56,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:27:56,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:27:56,359 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:27:56,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:27:56,360 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:27:56,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:27:56,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:27:56,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:27:56,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:27:56,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:27:56,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:27:56,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:27:56,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:27:56,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:27:56,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:27:56,366 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:27:56,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:27:56,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:27:56,367 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:27:56,368 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_934ad1b2-c85f-453a-97f4-14abfff7c503/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_934ad1b2-c85f-453a-97f4-14abfff7c503/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 -> fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc [2023-11-06 22:27:56,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:27:56,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:27:56,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:27:56,722 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:27:56,722 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:27:56,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i [2023-11-06 22:28:00,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:28:00,407 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:28:00,409 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i [2023-11-06 22:28:00,419 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/data/f61d087a7/da19134e8e8d4aa39ba0383d1fd2a065/FLAGe70d86d0f [2023-11-06 22:28:00,435 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/data/f61d087a7/da19134e8e8d4aa39ba0383d1fd2a065 [2023-11-06 22:28:00,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:28:00,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:28:00,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:28:00,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:28:00,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:28:00,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7e3801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00, skipping insertion in model container [2023-11-06 22:28:00,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:28:00,676 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_934ad1b2-c85f-453a-97f4-14abfff7c503/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i[913,926] [2023-11-06 22:28:00,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:28:00,766 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:28:00,779 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_934ad1b2-c85f-453a-97f4-14abfff7c503/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i[913,926] [2023-11-06 22:28:00,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:28:00,834 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:28:00,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00 WrapperNode [2023-11-06 22:28:00,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:28:00,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:28:00,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:28:00,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:28:00,846 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:28:00" (1/1) ... [2023-11-06 22:28:00,870 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:28:00" (1/1) ... [2023-11-06 22:28:00,918 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2023-11-06 22:28:00,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:28:00,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:28:00,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:28:00,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:28:00,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:28:00,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:28:00,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:28:00,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:28:00,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (1/1) ... [2023-11-06 22:28:00,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:28:01,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:01,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:01,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:01,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:28:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:28:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:28:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:28:01,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:28:01,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:28:01,233 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:28:01,236 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:28:01,722 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:28:01,731 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:28:01,731 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:28:01,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:01 BoogieIcfgContainer [2023-11-06 22:28:01,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:28:01,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:28:01,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:28:01,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:28:01,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:28:00" (1/3) ... [2023-11-06 22:28:01,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbe1791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:01, skipping insertion in model container [2023-11-06 22:28:01,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:00" (2/3) ... [2023-11-06 22:28:01,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbe1791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:01, skipping insertion in model container [2023-11-06 22:28:01,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:01" (3/3) ... [2023-11-06 22:28:01,747 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-65.i [2023-11-06 22:28:01,773 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:28:01,774 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:28:01,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:28:01,877 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;@62b35946, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:28:01,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:28:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:28:01,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:28:01,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:01,914 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:01,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:01,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1765448141, now seen corresponding path program 1 times [2023-11-06 22:28:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:01,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168119111] [2023-11-06 22:28:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:01,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:28:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:28:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:28:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:28:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:28:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:28:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:28:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:28:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:28:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:28:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:28:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:28:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:28:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:28:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:28:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:28:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:28:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:28:02,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:02,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168119111] [2023-11-06 22:28:02,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168119111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:02,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:02,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:28:02,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790605271] [2023-11-06 22:28:02,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:02,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:28:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:02,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:28:02,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:28:02,506 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:28:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:02,547 INFO L93 Difference]: Finished difference Result 139 states and 238 transitions. [2023-11-06 22:28:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:28:02,550 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122 [2023-11-06 22:28:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:02,562 INFO L225 Difference]: With dead ends: 139 [2023-11-06 22:28:02,562 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 22:28:02,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:28:02,572 INFO L413 NwaCegarLoop]: 103 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, 103 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:28:02,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:28:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 22:28:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-06 22:28:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:28:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2023-11-06 22:28:02,643 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 122 [2023-11-06 22:28:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:02,644 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2023-11-06 22:28:02,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:28:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2023-11-06 22:28:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:28:02,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:02,650 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:02,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:28:02,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:02,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2007415343, now seen corresponding path program 1 times [2023-11-06 22:28:02,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:02,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844280815] [2023-11-06 22:28:02,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:28:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:28:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:28:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:28:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:28:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:28:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:28:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:28:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:28:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:28:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:28:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:28:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:28:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:28:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:28:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:28:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:28:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:28:03,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:03,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844280815] [2023-11-06 22:28:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844280815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:03,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:03,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:03,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521068938] [2023-11-06 22:28:03,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:03,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:28:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:03,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:28:03,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:28:03,157 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:03,346 INFO L93 Difference]: Finished difference Result 201 states and 303 transitions. [2023-11-06 22:28:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:28:03,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2023-11-06 22:28:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:03,353 INFO L225 Difference]: With dead ends: 201 [2023-11-06 22:28:03,357 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 22:28:03,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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:28:03,362 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 87 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:03,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 261 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:28:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 22:28:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 85. [2023-11-06 22:28:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:28:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 126 transitions. [2023-11-06 22:28:03,402 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 126 transitions. Word has length 122 [2023-11-06 22:28:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:03,405 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 126 transitions. [2023-11-06 22:28:03,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 126 transitions. [2023-11-06 22:28:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-06 22:28:03,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:03,410 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:03,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:28:03,411 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:03,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1308200243, now seen corresponding path program 1 times [2023-11-06 22:28:03,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:03,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474768084] [2023-11-06 22:28:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:03,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:28:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:28:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:28:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:28:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:28:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:28:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:28:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:28:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:28:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:28:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:28:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:28:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:28:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:28:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:28:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:28:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:28:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:28:03,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:03,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474768084] [2023-11-06 22:28:03,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474768084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:03,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:03,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853138642] [2023-11-06 22:28:03,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:03,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:28:03,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:03,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:28:03,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:28:03,648 INFO L87 Difference]: Start difference. First operand 85 states and 126 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:03,679 INFO L93 Difference]: Finished difference Result 149 states and 218 transitions. [2023-11-06 22:28:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:28:03,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2023-11-06 22:28:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:03,683 INFO L225 Difference]: With dead ends: 149 [2023-11-06 22:28:03,683 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 22:28:03,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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:28:03,687 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 19 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:03,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:28:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 22:28:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-06 22:28:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:28:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2023-11-06 22:28:03,700 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 123 [2023-11-06 22:28:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:03,701 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2023-11-06 22:28:03,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2023-11-06 22:28:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:28:03,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:03,706 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:03,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:28:03,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:03,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:03,707 INFO L85 PathProgramCache]: Analyzing trace with hash 686777876, now seen corresponding path program 1 times [2023-11-06 22:28:03,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:03,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747378748] [2023-11-06 22:28:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:03,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:28:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:28:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:28:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:28:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:28:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:28:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:28:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:28:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:28:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:28:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:28:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:28:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:28:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:28:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:28:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:28:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:28:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:28:05,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:05,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747378748] [2023-11-06 22:28:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747378748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:05,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788622958] [2023-11-06 22:28:05,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:05,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:05,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:05,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:05,265 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:05,938 INFO L93 Difference]: Finished difference Result 166 states and 237 transitions. [2023-11-06 22:28:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:05,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2023-11-06 22:28:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:05,942 INFO L225 Difference]: With dead ends: 166 [2023-11-06 22:28:05,942 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 22:28:05,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:05,951 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 104 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:05,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 383 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:28:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 22:28:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 67. [2023-11-06 22:28:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:28:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2023-11-06 22:28:05,989 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 124 [2023-11-06 22:28:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:05,990 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2023-11-06 22:28:05,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2023-11-06 22:28:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-06 22:28:05,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:05,994 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:05,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:28:05,995 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:05,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash -428301366, now seen corresponding path program 1 times [2023-11-06 22:28:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:05,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383970925] [2023-11-06 22:28:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:28:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:28:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:28:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:28:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:28:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:28:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:28:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:28:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:28:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:28:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:28:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:28:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:28:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:28:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:28:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:28:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:28:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:28:06,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:06,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383970925] [2023-11-06 22:28:06,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383970925] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:28:06,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033287268] [2023-11-06 22:28:06,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:06,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:28:06,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:06,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:28:06,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:28:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:06,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:28:06,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2023-11-06 22:28:07,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:28:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:28:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033287268] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:28:07,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:28:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-11-06 22:28:07,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653508935] [2023-11-06 22:28:07,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:28:07,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:28:07,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:07,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:28:07,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:07,483 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-06 22:28:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:07,912 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2023-11-06 22:28:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:28:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 128 [2023-11-06 22:28:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:07,916 INFO L225 Difference]: With dead ends: 150 [2023-11-06 22:28:07,916 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:28:07,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 286 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:28:07,919 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 167 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:07,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 205 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:28:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2023-11-06 22:28:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:28:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2023-11-06 22:28:07,958 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 128 [2023-11-06 22:28:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:07,959 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2023-11-06 22:28:07,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-06 22:28:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2023-11-06 22:28:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:28:07,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:07,963 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:07,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:08,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:28:08,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:08,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1108493523, now seen corresponding path program 1 times [2023-11-06 22:28:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:08,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524832657] [2023-11-06 22:28:08,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:08,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:28:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:28:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:28:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:28:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:28:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:28:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:28:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:28:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:28:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:28:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:28:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:28:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:28:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:28:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:28:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:28:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:28:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:28:09,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524832657] [2023-11-06 22:28:09,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524832657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:09,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:09,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:28:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778904132] [2023-11-06 22:28:09,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:09,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:09,670 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:28:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:10,212 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2023-11-06 22:28:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:28:10,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 129 [2023-11-06 22:28:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:10,215 INFO L225 Difference]: With dead ends: 172 [2023-11-06 22:28:10,215 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 22:28:10,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:10,217 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 187 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:10,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 169 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:28:10,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 22:28:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2023-11-06 22:28:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:28:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2023-11-06 22:28:10,279 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 129 [2023-11-06 22:28:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:10,281 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2023-11-06 22:28:10,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:28:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2023-11-06 22:28:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:28:10,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:10,285 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:10,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:28:10,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:10,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash 521687509, now seen corresponding path program 1 times [2023-11-06 22:28:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:10,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712312597] [2023-11-06 22:28:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:28:10,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:28:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:28:10,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:28:10,522 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:28:10,523 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:28:10,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:28:10,531 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:10,535 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:28:10,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:28:10 BoogieIcfgContainer [2023-11-06 22:28:10,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:28:10,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:28:10,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:28:10,727 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:28:10,728 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:01" (3/4) ... [2023-11-06 22:28:10,731 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:28:10,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:28:10,733 INFO L158 Benchmark]: Toolchain (without parser) took 10293.03ms. Allocated memory was 125.8MB in the beginning and 199.2MB in the end (delta: 73.4MB). Free memory was 88.3MB in the beginning and 154.6MB in the end (delta: -66.3MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2023-11-06 22:28:10,734 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 125.8MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:28:10,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.94ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 74.5MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:28:10,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.67ms. Allocated memory is still 125.8MB. Free memory was 74.5MB in the beginning and 71.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:28:10,735 INFO L158 Benchmark]: Boogie Preprocessor took 43.91ms. Allocated memory is still 125.8MB. Free memory was 71.2MB in the beginning and 69.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:28:10,736 INFO L158 Benchmark]: RCFGBuilder took 763.66ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 69.4MB in the beginning and 133.5MB in the end (delta: -64.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2023-11-06 22:28:10,737 INFO L158 Benchmark]: TraceAbstraction took 8986.15ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 132.7MB in the beginning and 155.6MB in the end (delta: -22.9MB). Peak memory consumption was 116.0MB. Max. memory is 16.1GB. [2023-11-06 22:28:10,737 INFO L158 Benchmark]: Witness Printer took 6.12ms. Allocated memory is still 199.2MB. Free memory was 155.6MB in the beginning and 154.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:28:10,741 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.41ms. Allocated memory is still 125.8MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.94ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 74.5MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.67ms. Allocated memory is still 125.8MB. Free memory was 74.5MB in the beginning and 71.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.91ms. Allocated memory is still 125.8MB. Free memory was 71.2MB in the beginning and 69.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 763.66ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 69.4MB in the beginning and 133.5MB in the end (delta: -64.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8986.15ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 132.7MB in the beginning and 155.6MB in the end (delta: -22.9MB). Peak memory consumption was 116.0MB. Max. memory is 16.1GB. * Witness Printer took 6.12ms. Allocated memory is still 199.2MB. Free memory was 155.6MB in the beginning and 154.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed short int last_1_var_1_1 = 4; [L41] unsigned char last_1_var_1_14 = 1; [L42] signed char last_1_var_1_16 = 50; [L43] signed long int last_1_var_1_23 = -16; [L44] unsigned char last_1_var_1_24 = 1; [L45] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L119] last_1_var_1_1 = var_1_1 [L120] last_1_var_1_14 = var_1_14 [L121] last_1_var_1_16 = var_1_16 [L122] last_1_var_1_23 = var_1_23 [L123] last_1_var_1_24 = var_1_24 [L124] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L89] var_1_11 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L91] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L91] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L92] var_1_12 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L93] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L94] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L94] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L95] var_1_13 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L96] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L97] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L97] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L98] var_1_15 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L99] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L100] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L100] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L101] var_1_19 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L102] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L103] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L103] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L104] var_1_21 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L105] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L106] var_1_22 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L107] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L108] var_1_25 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L109] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L110] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L111] var_1_26 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L112] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L113] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L114] var_1_27 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L115] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L116] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L116] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L135] RET updateVariables() [L136] CALL step() [L49] signed long int stepLocal_3 = last_1_var_1_23; [L50] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L51] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L62] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L64] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16=50, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L64] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L65] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=11/2, var_1_8=64] [L69] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L70] var_1_28 = var_1_21 [L71] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L72] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L73] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L77] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L78] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L79] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16 ^ var_1_16=0, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L79] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L80] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L82] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L83] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L127] EXPR var_1_16 ^ var_1_16 VAL [((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16 ^ var_1_16=0, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L127] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16 ^ var_1_16=0, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L127] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [(((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))=0, ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16 ^ var_1_16=0, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L127-L128] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000006, var_1_22=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=4, var_1_27=0, var_1_28=100000006, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 588 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 564 mSDsluCounter, 1282 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 590 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 449 IncrementalHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 692 mSDtfsCounter, 449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 500 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=6, InterpolantAutomatonStates: 31, 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, 6 MinimizatonAttempts, 91 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 3117 SizeOfPredicates, 5 NumberOfNonLiveVariables, 327 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 4797/4896 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:28:10,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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_934ad1b2-c85f-453a-97f4-14abfff7c503/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 fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:28:13,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:28:13,700 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:28:13,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:28:13,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:28:13,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:28:13,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:28:13,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:28:13,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:28:13,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:28:13,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:28:13,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:28:13,783 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:28:13,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:28:13,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:28:13,787 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:28:13,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:28:13,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:28:13,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:28:13,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:28:13,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:28:13,789 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:28:13,790 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:28:13,790 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:28:13,791 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:28:13,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:28:13,792 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:28:13,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:28:13,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:28:13,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:28:13,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:28:13,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:28:13,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:28:13,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:28:13,797 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:28:13,797 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:28:13,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:28:13,797 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:28:13,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:28:13,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:28:13,799 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:28:13,800 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:28:13,800 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_934ad1b2-c85f-453a-97f4-14abfff7c503/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_934ad1b2-c85f-453a-97f4-14abfff7c503/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 -> fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc [2023-11-06 22:28:14,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:28:14,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:28:14,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:28:14,302 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:28:14,302 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:28:14,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i [2023-11-06 22:28:17,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:28:18,319 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:28:18,319 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i [2023-11-06 22:28:18,333 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/data/82201d3c3/f62f1e065e7743dc88faaec1bea981b1/FLAG96adc8092 [2023-11-06 22:28:18,352 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/data/82201d3c3/f62f1e065e7743dc88faaec1bea981b1 [2023-11-06 22:28:18,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:28:18,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:28:18,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:28:18,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:28:18,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:28:18,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:18,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2465cf47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18, skipping insertion in model container [2023-11-06 22:28:18,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:18,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:28:18,608 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_934ad1b2-c85f-453a-97f4-14abfff7c503/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i[913,926] [2023-11-06 22:28:18,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:28:18,702 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:28:18,717 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_934ad1b2-c85f-453a-97f4-14abfff7c503/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-65.i[913,926] [2023-11-06 22:28:18,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:28:18,780 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:28:18,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18 WrapperNode [2023-11-06 22:28:18,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:28:18,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:28:18,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:28:18,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:28:18,792 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:28:18" (1/1) ... [2023-11-06 22:28:18,809 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:28:18" (1/1) ... [2023-11-06 22:28:18,887 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2023-11-06 22:28:18,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:28:18,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:28:18,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:28:18,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:28:18,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:18,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:18,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:18,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:18,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:18,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:18,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:18,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:19,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:28:19,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:28:19,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:28:19,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:28:19,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (1/1) ... [2023-11-06 22:28:19,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:28:19,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:19,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:19,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:28:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:28:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:28:19,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:28:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:28:19,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:28:19,262 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:28:19,264 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:28:21,363 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:28:21,371 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:28:21,372 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:28:21,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:21 BoogieIcfgContainer [2023-11-06 22:28:21,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:28:21,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:28:21,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:28:21,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:28:21,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:28:18" (1/3) ... [2023-11-06 22:28:21,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47099d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:21, skipping insertion in model container [2023-11-06 22:28:21,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:18" (2/3) ... [2023-11-06 22:28:21,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47099d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:21, skipping insertion in model container [2023-11-06 22:28:21,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:21" (3/3) ... [2023-11-06 22:28:21,395 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-65.i [2023-11-06 22:28:21,422 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:28:21,422 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:28:21,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:28:21,524 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;@19de2768, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:28:21,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:28:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:28:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:28:21,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:21,548 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:21,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:21,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1160894003, now seen corresponding path program 1 times [2023-11-06 22:28:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960852231] [2023-11-06 22:28:21,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:21,587 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:28:21,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:21,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:21,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:28:22,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-06 22:28:22,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:22,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960852231] [2023-11-06 22:28:22,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960852231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:22,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:22,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:28:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335108962] [2023-11-06 22:28:22,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:22,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:28:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:22,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:28:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:28:22,234 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:28:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:22,274 INFO L93 Difference]: Finished difference Result 107 states and 182 transitions. [2023-11-06 22:28:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:28:22,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2023-11-06 22:28:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:22,288 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:28:22,288 INFO L226 Difference]: Without dead ends: 53 [2023-11-06 22:28:22,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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:28:22,298 INFO L413 NwaCegarLoop]: 77 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, 77 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:28:22,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:28:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-06 22:28:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-06 22:28:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:28:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2023-11-06 22:28:22,355 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 116 [2023-11-06 22:28:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:22,356 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2023-11-06 22:28:22,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:28:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2023-11-06 22:28:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:28:22,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:22,361 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:22,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:22,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:22,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:22,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash -464704823, now seen corresponding path program 1 times [2023-11-06 22:28:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:22,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985276266] [2023-11-06 22:28:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:22,581 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:28:22,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:22,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:22,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:23,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:28:23,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:28:23,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:23,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985276266] [2023-11-06 22:28:23,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985276266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:23,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:23,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:28:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168176111] [2023-11-06 22:28:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:23,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:28:23,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:23,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:28:23,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:28:23,614 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:24,953 INFO L93 Difference]: Finished difference Result 153 states and 225 transitions. [2023-11-06 22:28:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:28:24,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2023-11-06 22:28:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:24,958 INFO L225 Difference]: With dead ends: 153 [2023-11-06 22:28:24,959 INFO L226 Difference]: Without dead ends: 103 [2023-11-06 22:28:24,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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:28:24,962 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:24,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:28:24,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-06 22:28:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2023-11-06 22:28:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:28:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 149 transitions. [2023-11-06 22:28:25,002 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 149 transitions. Word has length 116 [2023-11-06 22:28:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:25,003 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 149 transitions. [2023-11-06 22:28:25,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 149 transitions. [2023-11-06 22:28:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:28:25,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:25,007 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:25,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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)] Ended with exit code 0 [2023-11-06 22:28:25,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:25,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:25,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash -521963125, now seen corresponding path program 1 times [2023-11-06 22:28:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:25,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856275121] [2023-11-06 22:28:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:25,229 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:28:25,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:25,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:25,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:28:25,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2023-11-06 22:28:26,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:28:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:28:26,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856275121] [2023-11-06 22:28:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856275121] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:28:26,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:28:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-11-06 22:28:26,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992859293] [2023-11-06 22:28:26,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:28:26,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:28:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:26,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:28:26,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:28:26,608 INFO L87 Difference]: Start difference. First operand 101 states and 149 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-06 22:28:28,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:29,006 INFO L93 Difference]: Finished difference Result 176 states and 252 transitions. [2023-11-06 22:28:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:28:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 116 [2023-11-06 22:28:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:29,014 INFO L225 Difference]: With dead ends: 176 [2023-11-06 22:28:29,017 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:28:29,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:28:29,023 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 133 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:29,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 152 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-06 22:28:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:28:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2023-11-06 22:28:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 73 states have internal predecessors, (86), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-06 22:28:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2023-11-06 22:28:29,104 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 116 [2023-11-06 22:28:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:29,105 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2023-11-06 22:28:29,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-11-06 22:28:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2023-11-06 22:28:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 22:28:29,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:29,117 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:29,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:29,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:29,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:29,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1756507905, now seen corresponding path program 1 times [2023-11-06 22:28:29,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:29,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982082538] [2023-11-06 22:28:29,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:29,344 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:28:29,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:29,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:29,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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 (5)] Waiting until timeout for monitored process [2023-11-06 22:28:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:29,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:28:29,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:28:29,950 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:29,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982082538] [2023-11-06 22:28:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982082538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:29,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:29,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:29,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100785835] [2023-11-06 22:28:29,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:29,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:29,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:29,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:29,960 INFO L87 Difference]: Start difference. First operand 119 states and 170 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:31,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:32,249 INFO L93 Difference]: Finished difference Result 286 states and 393 transitions. [2023-11-06 22:28:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:28:32,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2023-11-06 22:28:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:32,256 INFO L225 Difference]: With dead ends: 286 [2023-11-06 22:28:32,257 INFO L226 Difference]: Without dead ends: 180 [2023-11-06 22:28:32,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:28:32,260 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 100 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:32,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 241 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 22:28:32,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-06 22:28:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 95. [2023-11-06 22:28:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 22:28:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2023-11-06 22:28:32,296 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 117 [2023-11-06 22:28:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:32,297 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2023-11-06 22:28:32,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2023-11-06 22:28:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 22:28:32,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:32,301 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:32,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:32,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:32,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:32,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1754660863, now seen corresponding path program 1 times [2023-11-06 22:28:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:32,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125929264] [2023-11-06 22:28:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:32,525 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:28:32,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:32,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:32,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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 (6)] Waiting until timeout for monitored process [2023-11-06 22:28:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:32,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:28:32,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-11-06 22:28:33,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:28:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:28:33,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:33,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125929264] [2023-11-06 22:28:33,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125929264] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:28:33,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:28:33,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:28:33,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720165427] [2023-11-06 22:28:33,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:33,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:33,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:33,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:33,786 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:36,369 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2023-11-06 22:28:36,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:36,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2023-11-06 22:28:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:36,376 INFO L225 Difference]: With dead ends: 246 [2023-11-06 22:28:36,377 INFO L226 Difference]: Without dead ends: 188 [2023-11-06 22:28:36,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:28:36,379 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:36,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 178 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-06 22:28:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-06 22:28:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2023-11-06 22:28:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 106 states have internal predecessors, (113), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-06 22:28:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2023-11-06 22:28:36,432 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 117 [2023-11-06 22:28:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:36,434 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2023-11-06 22:28:36,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:28:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2023-11-06 22:28:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 22:28:36,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:36,444 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:36,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:36,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:36,665 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:36,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash 765299071, now seen corresponding path program 1 times [2023-11-06 22:28:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59098034] [2023-11-06 22:28:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:36,667 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:28:36,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:36,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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:28:36,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_934ad1b2-c85f-453a-97f4-14abfff7c503/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 (7)] Waiting until timeout for monitored process [2023-11-06 22:28:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:37,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 22:28:37,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:29:20,321 WARN L293 SmtUtils]: Spent 13.99s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:29:54,962 WARN L293 SmtUtils]: Spent 14.54s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:30:29,252 WARN L293 SmtUtils]: Spent 15.61s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:31:11,757 WARN L293 SmtUtils]: Spent 16.62s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)