./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 fb87e983d21d7edfae5fed43f2c976d705085cd9bb7ca844eb724af3c5ed0b1d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:20:07,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:20:07,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:20:07,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:20:07,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:20:07,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:20:07,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:20:07,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:20:07,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:20:07,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:20:07,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:20:07,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:20:07,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:20:07,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:20:07,459 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:20:07,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:20:07,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:20:07,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:20:07,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:20:07,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:20:07,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:20:07,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:20:07,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:20:07,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:20:07,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:20:07,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:20:07,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:20:07,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:20:07,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:20:07,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:20:07,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:20:07,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:20:07,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:07,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:20:07,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:20:07,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:20:07,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:20:07,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:20:07,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:20:07,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:20:07,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:20:07,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:20:07,474 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> fb87e983d21d7edfae5fed43f2c976d705085cd9bb7ca844eb724af3c5ed0b1d [2024-10-24 05:20:07,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:20:07,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:20:07,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:20:07,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:20:07,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:20:07,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i [2024-10-24 05:20:09,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:20:09,565 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:20:09,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i [2024-10-24 05:20:09,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5b21f67/4946ad235fd5456abe24891cf0111f67/FLAG09fb5079a [2024-10-24 05:20:09,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5b21f67/4946ad235fd5456abe24891cf0111f67 [2024-10-24 05:20:09,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:20:09,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:20:09,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:09,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:20:09,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:20:09,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:09,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38032ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09, skipping insertion in model container [2024-10-24 05:20:09,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:09,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:20:09,829 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i[912,925] [2024-10-24 05:20:09,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:09,927 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:20:09,940 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i[912,925] [2024-10-24 05:20:09,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:09,998 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:20:09,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09 WrapperNode [2024-10-24 05:20:09,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:10,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:10,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:20:10,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:20:10,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,061 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2024-10-24 05:20:10,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:10,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:20:10,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:20:10,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:20:10,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,112 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:20:10,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:20:10,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:20:10,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:20:10,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:20:10,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (1/1) ... [2024-10-24 05:20:10,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:10,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:10,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:20:10,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:20:10,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:20:10,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:20:10,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:20:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:20:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:20:10,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:20:10,331 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:20:10,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:20:10,714 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:20:10,714 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:20:10,784 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:20:10,785 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:20:10,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:10 BoogieIcfgContainer [2024-10-24 05:20:10,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:20:10,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:20:10,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:20:10,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:20:10,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:20:09" (1/3) ... [2024-10-24 05:20:10,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6567ce66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:10, skipping insertion in model container [2024-10-24 05:20:10,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:09" (2/3) ... [2024-10-24 05:20:10,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6567ce66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:10, skipping insertion in model container [2024-10-24 05:20:10,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:10" (3/3) ... [2024-10-24 05:20:10,796 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-4.i [2024-10-24 05:20:10,831 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:20:10,831 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:20:10,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:20:10,924 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4e56c0aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:20:10,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:20:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 05:20:10,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:10,944 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:10,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:10,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:10,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1983052405, now seen corresponding path program 1 times [2024-10-24 05:20:10,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:20:10,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141460171] [2024-10-24 05:20:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:20:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:20:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:20:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:20:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:20:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:20:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:20:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:20:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:20:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:20:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:20:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:20:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:20:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:20:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:20:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:20:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:20:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:20:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:20:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:20:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:20:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:20:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:20:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 05:20:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:20:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:20:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:20:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:20:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:20:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:20:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:20:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 05:20:11,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:20:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141460171] [2024-10-24 05:20:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141460171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:20:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:20:11,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:20:11,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983762378] [2024-10-24 05:20:11,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:20:11,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:20:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:20:11,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:20:11,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:20:11,551 INFO L87 Difference]: Start difference. First operand has 70 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 05:20:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:11,594 INFO L93 Difference]: Finished difference Result 137 states and 254 transitions. [2024-10-24 05:20:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:20:11,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 177 [2024-10-24 05:20:11,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:11,605 INFO L225 Difference]: With dead ends: 137 [2024-10-24 05:20:11,605 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 05:20:11,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:20:11,616 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:11,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:20:11,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 05:20:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-24 05:20:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 107 transitions. [2024-10-24 05:20:11,667 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 107 transitions. Word has length 177 [2024-10-24 05:20:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:11,667 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 107 transitions. [2024-10-24 05:20:11,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 05:20:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 107 transitions. [2024-10-24 05:20:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 05:20:11,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:11,673 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:11,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:20:11,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:11,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1687237511, now seen corresponding path program 1 times [2024-10-24 05:20:11,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:20:11,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200361479] [2024-10-24 05:20:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:11,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:20:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:20:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:20:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:20:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:20:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:20:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:20:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:20:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:20:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:20:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:20:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:20:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:20:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:20:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:20:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:20:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:20:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:20:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:20:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:20:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:20:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:20:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:20:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 05:20:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:20:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:20:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:20:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:20:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:20:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:20:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:20:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:20:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:20:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200361479] [2024-10-24 05:20:12,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200361479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:20:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402106252] [2024-10-24 05:20:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:12,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:20:12,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:12,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:20:12,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:20:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:13,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 05:20:13,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:20:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2024-10-24 05:20:13,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:20:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:20:13,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402106252] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:20:13,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:20:13,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-24 05:20:13,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517257027] [2024-10-24 05:20:13,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:20:13,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 05:20:13,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:20:13,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 05:20:13,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:20:13,860 INFO L87 Difference]: Start difference. First operand 68 states and 107 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-24 05:20:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:14,577 INFO L93 Difference]: Finished difference Result 230 states and 342 transitions. [2024-10-24 05:20:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 05:20:14,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 177 [2024-10-24 05:20:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:14,584 INFO L225 Difference]: With dead ends: 230 [2024-10-24 05:20:14,585 INFO L226 Difference]: Without dead ends: 163 [2024-10-24 05:20:14,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=396, Unknown=0, NotChecked=0, Total=600 [2024-10-24 05:20:14,590 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 257 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:14,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 263 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 05:20:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-24 05:20:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 96. [2024-10-24 05:20:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 59 states have internal predecessors, (78), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 05:20:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-24 05:20:14,624 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 177 [2024-10-24 05:20:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:14,625 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-24 05:20:14,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-24 05:20:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-24 05:20:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 05:20:14,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:14,631 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:14,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 05:20:14,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:20:14,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:14,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1189710297, now seen corresponding path program 1 times [2024-10-24 05:20:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:20:14,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112660104] [2024-10-24 05:20:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:20:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:20:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:20:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:20:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:20:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:20:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:20:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:20:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:20:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:20:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:20:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:20:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:20:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:20:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:20:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:20:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:20:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:20:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:20:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:20:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:20:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:20:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:20:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 05:20:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:20:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:20:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:20:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:20:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:20:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:20:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:20:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:20:15,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:20:15,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112660104] [2024-10-24 05:20:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112660104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:20:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891559715] [2024-10-24 05:20:15,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:15,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:20:15,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:15,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:20:15,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 05:20:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:15,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 05:20:15,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:20:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2024-10-24 05:20:16,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:20:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:20:16,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891559715] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:20:16,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:20:16,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2024-10-24 05:20:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976267428] [2024-10-24 05:20:16,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:20:16,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 05:20:16,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:20:16,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 05:20:16,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:20:16,543 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 4 states have call predecessors, (90), 4 states have call successors, (90) [2024-10-24 05:20:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:17,233 INFO L93 Difference]: Finished difference Result 366 states and 537 transitions. [2024-10-24 05:20:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 05:20:17,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 4 states have call predecessors, (90), 4 states have call successors, (90) Word has length 178 [2024-10-24 05:20:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:17,242 INFO L225 Difference]: With dead ends: 366 [2024-10-24 05:20:17,243 INFO L226 Difference]: Without dead ends: 271 [2024-10-24 05:20:17,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2024-10-24 05:20:17,246 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:17,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 279 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 05:20:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-24 05:20:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 162. [2024-10-24 05:20:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 92 states have internal predecessors, (115), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 05:20:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 243 transitions. [2024-10-24 05:20:17,286 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 243 transitions. Word has length 178 [2024-10-24 05:20:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:17,287 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 243 transitions. [2024-10-24 05:20:17,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 4 states have call predecessors, (90), 4 states have call successors, (90) [2024-10-24 05:20:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 243 transitions. [2024-10-24 05:20:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 05:20:17,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:17,290 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:17,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 05:20:17,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 05:20:17,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:17,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:17,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2060074977, now seen corresponding path program 1 times [2024-10-24 05:20:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:20:17,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376195257] [2024-10-24 05:20:17,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:20:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:20:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489446373] [2024-10-24 05:20:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:20:17,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:17,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:20:17,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 05:20:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:20:17,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:20:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:20:17,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:20:17,993 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:20:17,995 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:20:18,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 05:20:18,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:20:18,201 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 05:20:18,300 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:20:18,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:20:18 BoogieIcfgContainer [2024-10-24 05:20:18,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:20:18,304 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:20:18,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:20:18,304 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:20:18,305 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:10" (3/4) ... [2024-10-24 05:20:18,306 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:20:18,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:20:18,308 INFO L158 Benchmark]: Toolchain (without parser) took 8712.55ms. Allocated memory was 182.5MB in the beginning and 253.8MB in the end (delta: 71.3MB). Free memory was 124.0MB in the beginning and 102.5MB in the end (delta: 21.5MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. [2024-10-24 05:20:18,308 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 182.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:20:18,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.10ms. Allocated memory is still 182.5MB. Free memory was 123.7MB in the beginning and 107.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 05:20:18,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.31ms. Allocated memory is still 182.5MB. Free memory was 107.1MB in the beginning and 104.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:20:18,309 INFO L158 Benchmark]: Boogie Preprocessor took 76.75ms. Allocated memory is still 182.5MB. Free memory was 104.0MB in the beginning and 99.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:20:18,309 INFO L158 Benchmark]: RCFGBuilder took 646.18ms. Allocated memory is still 182.5MB. Free memory was 99.8MB in the beginning and 75.1MB in the end (delta: 24.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 05:20:18,309 INFO L158 Benchmark]: TraceAbstraction took 7515.24ms. Allocated memory was 182.5MB in the beginning and 253.8MB in the end (delta: 71.3MB). Free memory was 74.3MB in the beginning and 102.5MB in the end (delta: -28.2MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-10-24 05:20:18,310 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 253.8MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:20:18,311 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.16ms. Allocated memory is still 182.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.10ms. Allocated memory is still 182.5MB. Free memory was 123.7MB in the beginning and 107.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.31ms. Allocated memory is still 182.5MB. Free memory was 107.1MB in the beginning and 104.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.75ms. Allocated memory is still 182.5MB. Free memory was 104.0MB in the beginning and 99.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 646.18ms. Allocated memory is still 182.5MB. Free memory was 99.8MB in the beginning and 75.1MB in the end (delta: 24.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7515.24ms. Allocated memory was 182.5MB in the beginning and 253.8MB in the end (delta: 71.3MB). Free memory was 74.3MB in the beginning and 102.5MB in the end (delta: -28.2MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 253.8MB. Free memory is still 102.5MB. 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 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned short int var_1_2 = 256; [L24] unsigned short int var_1_3 = 128; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned short int var_1_6 = 4; [L28] signed short int var_1_7 = 32; [L29] signed long int var_1_8 = 100000000; [L30] unsigned short int var_1_9 = 4; [L31] unsigned short int var_1_10 = 10; [L32] double var_1_11 = 15.6; [L33] double var_1_12 = 256.4; [L34] double var_1_13 = 49.15; [L35] unsigned long int var_1_14 = 500; [L36] unsigned long int var_1_15 = 2173307753; [L37] unsigned long int var_1_16 = 3362224480; [L38] signed short int var_1_17 = 16; [L39] unsigned short int var_1_18 = 16; [L40] signed short int var_1_19 = 16; [L41] signed short int var_1_20 = 4; [L42] signed short int var_1_21 = 0; [L43] signed short int var_1_22 = -25; [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L89] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L89] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L90] var_1_3 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L92] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L95] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L95] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L98] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L98] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L99] var_1_7 = __VERIFIER_nondet_short() [L100] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=100000000, var_1_9=4] [L100] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=100000000, var_1_9=4] [L101] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=100000000, var_1_9=4] [L101] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=100000000, var_1_9=4] [L102] var_1_8 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L103] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L104] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L104] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L105] var_1_10 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L106] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L107] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L108] var_1_12 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L109] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L110] var_1_13 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L111] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L112] var_1_15 = __VERIFIER_nondet_ulong() [L113] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L113] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L114] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L114] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L115] var_1_16 = __VERIFIER_nondet_ulong() [L116] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L116] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L117] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L117] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L118] var_1_18 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L119] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L120] CALL assume_abort_if_not(var_1_18 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L120] RET assume_abort_if_not(var_1_18 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L121] var_1_19 = __VERIFIER_nondet_short() [L122] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L122] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L123] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L123] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L124] var_1_20 = __VERIFIER_nondet_short() [L125] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L125] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L126] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L126] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L127] var_1_21 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L128] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L129] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L129] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L130] var_1_22 = __VERIFIER_nondet_short() [L131] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L131] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L132] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L132] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L145] RET updateVariables() [L146] CALL step() [L47] COND FALSE !(var_1_2 <= var_1_3) [L52] var_1_1 = (var_1_4 || var_1_5) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L54] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L59] COND FALSE !(var_1_4 || var_1_1) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=4] [L62] COND FALSE !(var_1_7 >= var_1_3) [L65] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=0] [L68] COND FALSE !(var_1_6 <= var_1_2) [L73] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=0] [L75] COND TRUE var_1_6 >= var_1_3 [L76] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=7516192765, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=0] [L78] COND FALSE !(var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=7516192765, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=0] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return ((((((var_1_2 <= var_1_3) ? (((- var_1_3) > var_1_2) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((var_1_2 * (var_1_3 + var_1_7)) > var_1_8) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_7 >= var_1_3) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_6 <= var_1_2) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((var_1_6 >= var_1_3) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - var_1_2))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (var_1_9 >= ((((var_1_18) > (var_1_7)) ? (var_1_18) : (var_1_7))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=7516192765, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=7516192765, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=-1, var_1_8=-2147483648, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 4, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 506 mSDsluCounter, 646 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 392 mSDsCounter, 352 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 851 IncrementalHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 352 mSolverCounterUnsat, 254 mSDtfsCounter, 851 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 956 GetRequests, 909 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=3, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 176 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1243 NumberOfCodeBlocks, 1243 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1235 ConstructedInterpolants, 0 QuantifiedInterpolants, 4280 SizeOfPredicates, 4 NumberOfNonLiveVariables, 763 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 11748/12180 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 [2024-10-24 05:20:18,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 fb87e983d21d7edfae5fed43f2c976d705085cd9bb7ca844eb724af3c5ed0b1d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:20:20,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:20:20,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:20:20,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:20:20,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:20:20,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:20:20,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:20:20,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:20:20,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:20:20,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:20:20,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:20:20,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:20:20,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:20:20,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:20:20,740 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:20:20,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:20:20,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:20:20,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:20:20,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:20:20,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:20:20,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:20:20,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:20:20,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:20:20,747 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:20:20,747 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:20:20,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:20:20,748 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:20:20,748 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:20:20,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:20:20,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:20:20,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:20:20,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:20:20,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:20:20,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:20:20,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:20,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:20:20,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:20:20,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:20:20,751 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:20:20,751 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:20:20,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:20:20,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:20:20,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:20:20,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:20:20,754 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:20:20,754 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> fb87e983d21d7edfae5fed43f2c976d705085cd9bb7ca844eb724af3c5ed0b1d [2024-10-24 05:20:21,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:20:21,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:20:21,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:20:21,114 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:20:21,115 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:20:21,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i [2024-10-24 05:20:22,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:20:22,938 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:20:22,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i [2024-10-24 05:20:22,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d22507e3/081365149f934463a1b289cada4937ff/FLAG10dea9c60 [2024-10-24 05:20:22,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d22507e3/081365149f934463a1b289cada4937ff [2024-10-24 05:20:22,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:20:22,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:20:22,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:22,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:20:22,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:20:22,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:22" (1/1) ... [2024-10-24 05:20:22,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5e55f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:22, skipping insertion in model container [2024-10-24 05:20:22,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:22" (1/1) ... [2024-10-24 05:20:23,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:20:23,194 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i[912,925] [2024-10-24 05:20:23,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:23,289 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:20:23,302 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i[912,925] [2024-10-24 05:20:23,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:23,363 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:20:23,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23 WrapperNode [2024-10-24 05:20:23,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:23,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:23,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:20:23,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:20:23,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,429 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-10-24 05:20:23,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:23,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:20:23,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:20:23,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:20:23,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,467 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:20:23,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:20:23,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:20:23,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:20:23,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:20:23,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (1/1) ... [2024-10-24 05:20:23,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:23,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:23,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:20:23,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:20:23,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:20:23,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:20:23,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:20:23,580 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:20:23,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:20:23,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:20:23,654 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:20:23,656 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:20:24,513 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:20:24,513 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:20:24,584 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:20:24,586 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:20:24,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:24 BoogieIcfgContainer [2024-10-24 05:20:24,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:20:24,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:20:24,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:20:24,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:20:24,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:20:22" (1/3) ... [2024-10-24 05:20:24,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556b404e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:24, skipping insertion in model container [2024-10-24 05:20:24,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:23" (2/3) ... [2024-10-24 05:20:24,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556b404e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:24, skipping insertion in model container [2024-10-24 05:20:24,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:24" (3/3) ... [2024-10-24 05:20:24,597 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-4.i [2024-10-24 05:20:24,613 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:20:24,613 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:20:24,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:20:24,692 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@19caed09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:20:24,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:20:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 05:20:24,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:24,707 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:24,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:24,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1983052405, now seen corresponding path program 1 times [2024-10-24 05:20:24,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:20:24,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660524908] [2024-10-24 05:20:24,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:24,727 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 [2024-10-24 05:20:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:20:24,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2024-10-24 05:20:24,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-10-24 05:20:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:25,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:20:25,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:20:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 874 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2024-10-24 05:20:25,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:20:25,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:20:25,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660524908] [2024-10-24 05:20:25,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660524908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:20:25,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:20:25,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:20:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628614178] [2024-10-24 05:20:25,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:20:25,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:20:25,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:20:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:20:25,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:20:25,144 INFO L87 Difference]: Start difference. First operand has 70 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 05:20:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:25,381 INFO L93 Difference]: Finished difference Result 137 states and 254 transitions. [2024-10-24 05:20:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:20:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 177 [2024-10-24 05:20:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:25,399 INFO L225 Difference]: With dead ends: 137 [2024-10-24 05:20:25,399 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 05:20:25,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:20:25,405 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:25,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:20:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 05:20:25,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-24 05:20:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 107 transitions. [2024-10-24 05:20:25,458 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 107 transitions. Word has length 177 [2024-10-24 05:20:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:25,459 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 107 transitions. [2024-10-24 05:20:25,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 05:20:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 107 transitions. [2024-10-24 05:20:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 05:20:25,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:25,463 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:25,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-10-24 05:20:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-10-24 05:20:25,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:25,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:25,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1687237511, now seen corresponding path program 1 times [2024-10-24 05:20:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:20:25,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667590780] [2024-10-24 05:20:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:25,666 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 [2024-10-24 05:20:25,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:20:25,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2024-10-24 05:20:25,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-10-24 05:20:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:25,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 05:20:25,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:20:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 635 proven. 135 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-10-24 05:20:26,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:20:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 138 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-10-24 05:20:27,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:20:27,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667590780] [2024-10-24 05:20:27,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667590780] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:20:27,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:20:27,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-24 05:20:27,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075835222] [2024-10-24 05:20:27,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:20:27,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 05:20:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:20:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 05:20:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-24 05:20:27,529 INFO L87 Difference]: Start difference. First operand 68 states and 107 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-24 05:20:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:28,714 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2024-10-24 05:20:28,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 05:20:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 177 [2024-10-24 05:20:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:28,721 INFO L225 Difference]: With dead ends: 169 [2024-10-24 05:20:28,722 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 05:20:28,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2024-10-24 05:20:28,725 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:28,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 210 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 05:20:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 05:20:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2024-10-24 05:20:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 55 states have internal predecessors, (64), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 05:20:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-10-24 05:20:28,755 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 177 [2024-10-24 05:20:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:28,757 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-10-24 05:20:28,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-24 05:20:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-10-24 05:20:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 05:20:28,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:28,763 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:28,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-10-24 05:20:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-10-24 05:20:28,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1189710297, now seen corresponding path program 1 times [2024-10-24 05:20:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:20:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727066360] [2024-10-24 05:20:28,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:28,965 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 [2024-10-24 05:20:28,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:20:28,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2024-10-24 05:20:28,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-10-24 05:20:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:29,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 05:20:29,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:20:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2024-10-24 05:20:29,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:20:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:20:30,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:20:30,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727066360] [2024-10-24 05:20:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727066360] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:20:30,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:20:30,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2024-10-24 05:20:30,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971410998] [2024-10-24 05:20:30,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:20:30,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:20:30,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:20:30,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:20:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:20:30,341 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-10-24 05:20:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:31,142 INFO L93 Difference]: Finished difference Result 178 states and 248 transitions. [2024-10-24 05:20:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 05:20:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 178 [2024-10-24 05:20:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:31,155 INFO L225 Difference]: With dead ends: 178 [2024-10-24 05:20:31,155 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 05:20:31,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:20:31,156 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 53 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:31,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 121 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 05:20:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 05:20:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2024-10-24 05:20:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-10-24 05:20:31,173 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 178 [2024-10-24 05:20:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:31,173 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-10-24 05:20:31,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-10-24 05:20:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-10-24 05:20:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 05:20:31,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:31,176 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:31,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Ended with exit code 0 [2024-10-24 05:20:31,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-10-24 05:20:31,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:31,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2060074977, now seen corresponding path program 1 times [2024-10-24 05:20:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:20:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974300136] [2024-10-24 05:20:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:31,380 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 [2024-10-24 05:20:31,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:20:31,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2024-10-24 05:20:31,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-10-24 05:20:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:31,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 05:20:31,601 INFO L278 TraceCheckSpWp]: Computing forward predicates...