./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.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 d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:40:34,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:40:34,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:40:34,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:40:34,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:40:34,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:40:34,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:40:34,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:40:34,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:40:34,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:40:34,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:40:34,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:40:34,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:40:34,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:40:34,497 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:40:34,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:40:34,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:40:34,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:40:34,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:40:34,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:40:34,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:40:34,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:40:34,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:40:34,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:40:34,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:40:34,503 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:40:34,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:40:34,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:40:34,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:40:34,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:40:34,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:40:34,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:40:34,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:40:34,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:40:34,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:40:34,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:40:34,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:40:34,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:40:34,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:40:34,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:40:34,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:40:34,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:40:34,508 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 -> d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 [2024-11-08 19:40:34,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:40:34,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:40:34,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:40:34,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:40:34,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:40:34,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2024-11-08 19:40:36,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:40:36,431 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:40:36,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2024-11-08 19:40:36,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9620e50a0/323572f3d32c40abad54268badfbc6e0/FLAGb8ab51234 [2024-11-08 19:40:36,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9620e50a0/323572f3d32c40abad54268badfbc6e0 [2024-11-08 19:40:36,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:40:36,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:40:36,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:40:36,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:40:36,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:40:36,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:40:36" (1/1) ... [2024-11-08 19:40:36,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c289e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:36, skipping insertion in model container [2024-11-08 19:40:36,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:40:36" (1/1) ... [2024-11-08 19:40:36,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:40:37,035 WARN L250 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-85.i[913,926] [2024-11-08 19:40:37,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:40:37,099 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:40:37,110 WARN L250 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-85.i[913,926] [2024-11-08 19:40:37,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:40:37,154 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:40:37,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37 WrapperNode [2024-11-08 19:40:37,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:40:37,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:40:37,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:40:37,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:40:37,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,217 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-08 19:40:37,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:40:37,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:40:37,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:40:37,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:40:37,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,262 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-11-08 19:40:37,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:40:37,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:40:37,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:40:37,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:40:37,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (1/1) ... [2024-11-08 19:40:37,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:40:37,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:40:37,343 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-11-08 19:40:37,345 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-11-08 19:40:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:40:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:40:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:40:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:40:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:40:37,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:40:37,479 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:40:37,482 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:40:37,815 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:40:37,815 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:40:37,846 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:40:37,848 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:40:37,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:40:37 BoogieIcfgContainer [2024-11-08 19:40:37,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:40:37,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:40:37,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:40:37,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:40:37,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:40:36" (1/3) ... [2024-11-08 19:40:37,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271b7951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:40:37, skipping insertion in model container [2024-11-08 19:40:37,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:37" (2/3) ... [2024-11-08 19:40:37,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271b7951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:40:37, skipping insertion in model container [2024-11-08 19:40:37,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:40:37" (3/3) ... [2024-11-08 19:40:37,864 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-85.i [2024-11-08 19:40:37,891 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:40:37,891 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:40:37,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:40:37,970 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;@33f81d14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:40:37,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:40:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:40:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 19:40:37,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:40:37,988 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:40:37,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:40:37,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:40:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1085262619, now seen corresponding path program 1 times [2024-11-08 19:40:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:40:38,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523831865] [2024-11-08 19:40:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:40:38,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:40:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:40:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:40:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:40:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:40:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:40:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:40:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:40:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:40:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:40:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:40:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:40:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:40:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 19:40:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 19:40:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:40:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:40:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:40:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:40:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:40:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:40:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:40:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:40:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:40:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523831865] [2024-11-08 19:40:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523831865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:40:38,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:40:38,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:40:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496108637] [2024-11-08 19:40:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:40:38,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:40:38,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:40:38,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:40:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:40:38,546 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:40:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:40:38,583 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-08 19:40:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:40:38,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-08 19:40:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:40:38,593 INFO L225 Difference]: With dead ends: 119 [2024-11-08 19:40:38,593 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 19:40:38,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-11-08 19:40:38,603 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:40:38,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:40:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 19:40:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 19:40:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:40:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-08 19:40:38,656 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 139 [2024-11-08 19:40:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:40:38,657 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-08 19:40:38,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:40:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-08 19:40:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 19:40:38,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:40:38,664 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:40:38,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:40:38,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:40:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:40:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2074053391, now seen corresponding path program 1 times [2024-11-08 19:40:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:40:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888820982] [2024-11-08 19:40:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:40:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:40:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:40:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:40:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:40:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:40:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:40:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:40:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:40:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:40:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:40:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:40:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:40:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:40:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 19:40:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 19:40:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:40:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:40:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:40:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:40:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:40:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:40:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:40:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2024-11-08 19:40:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:40:39,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888820982] [2024-11-08 19:40:39,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888820982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:40:39,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146892316] [2024-11-08 19:40:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:40:39,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:40:39,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:40:39,983 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-11-08 19:40:39,985 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-11-08 19:40:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:40,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 19:40:40,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:40:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 553 proven. 45 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2024-11-08 19:40:40,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:40:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 75 proven. 48 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-08 19:40:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146892316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:40:41,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:40:41,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-08 19:40:41,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940080725] [2024-11-08 19:40:41,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:40:41,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:40:41,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:40:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:40:41,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:40:41,089 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-08 19:40:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:40:42,023 INFO L93 Difference]: Finished difference Result 222 states and 311 transitions. [2024-11-08 19:40:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 19:40:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 139 [2024-11-08 19:40:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:40:42,029 INFO L225 Difference]: With dead ends: 222 [2024-11-08 19:40:42,030 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 19:40:42,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 315 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=897, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 19:40:42,032 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 242 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:40:42,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 284 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 19:40:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 19:40:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 102. [2024-11-08 19:40:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 19:40:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2024-11-08 19:40:42,070 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 139 [2024-11-08 19:40:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:40:42,071 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2024-11-08 19:40:42,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-08 19:40:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2024-11-08 19:40:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 19:40:42,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:40:42,075 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:40:42,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:40:42,275 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-11-08 19:40:42,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:40:42,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:40:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2075900433, now seen corresponding path program 1 times [2024-11-08 19:40:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:40:42,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017564816] [2024-11-08 19:40:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:40:42,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:40:42,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220260057] [2024-11-08 19:40:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:40:42,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:40:42,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:40:42,359 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-11-08 19:40:42,361 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-11-08 19:40:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:40:42,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:40:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:40:42,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:40:42,627 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:40:42,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:40:42,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:40:42,830 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-11-08 19:40:42,834 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 19:40:42,928 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:40:42,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:40:42 BoogieIcfgContainer [2024-11-08 19:40:42,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:40:42,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:40:42,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:40:42,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:40:42,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:40:37" (3/4) ... [2024-11-08 19:40:42,937 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:40:42,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:40:42,940 INFO L158 Benchmark]: Toolchain (without parser) took 6130.03ms. Allocated memory was 174.1MB in the beginning and 222.3MB in the end (delta: 48.2MB). Free memory was 115.3MB in the beginning and 127.5MB in the end (delta: -12.2MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-11-08 19:40:42,940 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:40:42,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.45ms. Allocated memory is still 174.1MB. Free memory was 115.3MB in the beginning and 99.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:40:42,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.34ms. Allocated memory is still 174.1MB. Free memory was 99.0MB in the beginning and 95.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:40:42,942 INFO L158 Benchmark]: Boogie Preprocessor took 70.98ms. Allocated memory is still 174.1MB. Free memory was 95.4MB in the beginning and 90.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:40:42,946 INFO L158 Benchmark]: RCFGBuilder took 553.90ms. Allocated memory is still 174.1MB. Free memory was 90.2MB in the beginning and 141.9MB in the end (delta: -51.7MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-11-08 19:40:42,947 INFO L158 Benchmark]: TraceAbstraction took 5078.24ms. Allocated memory was 174.1MB in the beginning and 222.3MB in the end (delta: 48.2MB). Free memory was 141.2MB in the beginning and 128.5MB in the end (delta: 12.7MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2024-11-08 19:40:42,947 INFO L158 Benchmark]: Witness Printer took 6.39ms. Allocated memory is still 222.3MB. Free memory was 128.5MB in the beginning and 127.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:40:42,948 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.20ms. Allocated memory is still 174.1MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.45ms. Allocated memory is still 174.1MB. Free memory was 115.3MB in the beginning and 99.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.34ms. Allocated memory is still 174.1MB. Free memory was 99.0MB in the beginning and 95.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.98ms. Allocated memory is still 174.1MB. Free memory was 95.4MB in the beginning and 90.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 553.90ms. Allocated memory is still 174.1MB. Free memory was 90.2MB in the beginning and 141.9MB in the end (delta: -51.7MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5078.24ms. Allocated memory was 174.1MB in the beginning and 222.3MB in the end (delta: 48.2MB). Free memory was 141.2MB in the beginning and 128.5MB in the end (delta: 12.7MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 6.39ms. Allocated memory is still 222.3MB. Free memory was 128.5MB in the beginning and 127.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned short int var_1_2 = 2; [L24] unsigned short int var_1_3 = 8; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] float var_1_7 = 0.6; [L29] unsigned long int var_1_8 = 32; [L30] unsigned long int var_1_9 = 32; [L31] float var_1_10 = 49.359; [L32] float var_1_11 = 5.5; [L33] unsigned long int var_1_12 = 128; [L34] unsigned char var_1_13 = 16; [L35] unsigned char var_1_14 = 0; [L36] unsigned long int var_1_15 = 8; [L37] unsigned char var_1_16 = 0; [L38] unsigned char var_1_17 = 0; [L39] double var_1_18 = 1.8; [L40] double var_1_19 = 4.5; [L41] double var_1_20 = 15.5; VAL [isInitial=0, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_2=2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] FCALL updateLastVariables() [L127] CALL updateVariables() [L81] var_1_2 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L82] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L83] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L83] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_3=8, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L84] var_1_3 = __VERIFIER_nondet_ushort() [L85] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L85] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L86] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L86] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L87] var_1_4 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L88] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L89] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L89] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L90] var_1_6 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L91] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L92] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L92] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L93] var_1_8 = __VERIFIER_nondet_ulong() [L94] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L94] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L95] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L95] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L96] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=32] [L96] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=32] [L97] var_1_9 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L98] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L99] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L99] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263] [L100] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L100] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=49359/1000, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L101] var_1_10 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L102] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L103] var_1_11 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L104] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L107] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L107] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L108] var_1_17 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L109] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L110] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L110] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L111] var_1_19 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L112] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L113] var_1_20 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L114] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L127] RET updateVariables() [L128] CALL step() [L45] COND FALSE !(var_1_2 < ((- var_1_3) * 64)) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L56] COND TRUE var_1_2 <= (var_1_3 + var_1_1) [L57] var_1_5 = ((var_1_3 == var_1_2) && var_1_6) VAL [isInitial=1, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=-4294967263, var_1_9=1000] [L61] COND FALSE !((var_1_2 + (var_1_3 * var_1_1)) <= ((32u / var_1_8) / var_1_9)) [L66] var_1_7 = var_1_11 VAL [isInitial=1, var_1_11=2, var_1_12=128, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L68] COND TRUE var_1_7 <= (- (32.8f + var_1_10)) [L69] var_1_12 = var_1_3 VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=16, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L71] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L72] COND FALSE !(\read(var_1_4)) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L75] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L76] COND FALSE !(var_1_5 || var_1_17) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L128] RET step() [L129] CALL, EXPR property() [L119-L120] return ((((((((var_1_2 < ((- var_1_3) * 64)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : ((-10000000 < var_1_2) ? (var_1_1 == ((unsigned long int) (((((((var_1_3) > (5u)) ? (var_1_3) : (5u))) < 0 ) ? -((((var_1_3) > (5u)) ? (var_1_3) : (5u))) : ((((var_1_3) > (5u)) ? (var_1_3) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((var_1_2 <= (var_1_3 + var_1_1)) ? (var_1_5 == ((unsigned char) ((var_1_3 == var_1_2) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_2 + (var_1_3 * var_1_1)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_10) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_10))) ? (var_1_12 == ((unsigned long int) var_1_3)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_4 ? (var_1_15 == ((unsigned long int) ((((var_1_3) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_3) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_12=1, var_1_13=254, var_1_14=-258, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_2=-65536, var_1_3=-65535, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=-4294967263, var_1_9=1000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 3, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 170 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 383 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=2, InterpolantAutomatonStates: 33, 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, 2 MinimizatonAttempts, 65 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606 SizeOfPredicates, 5 NumberOfNonLiveVariables, 308 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3558/3696 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-11-08 19:40:42,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.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 d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:40:45,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:40:45,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:40:45,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:40:45,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:40:45,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:40:45,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:40:45,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:40:45,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:40:45,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:40:45,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:40:45,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:40:45,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:40:45,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:40:45,320 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:40:45,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:40:45,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:40:45,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:40:45,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:40:45,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:40:45,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:40:45,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:40:45,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:40:45,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:40:45,327 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:40:45,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:40:45,327 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:40:45,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:40:45,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:40:45,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:40:45,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:40:45,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:40:45,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:40:45,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:40:45,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:40:45,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:40:45,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:40:45,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:40:45,330 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:40:45,332 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:40:45,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:40:45,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:40:45,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:40:45,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:40:45,333 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 -> d9ca78178911556bbd04494b858a31f62bf8c4fa890b7ca4c32844eb26872874 [2024-11-08 19:40:45,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:40:45,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:40:45,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:40:45,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:40:45,684 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:40:45,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2024-11-08 19:40:47,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:40:47,505 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:40:47,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-85.i [2024-11-08 19:40:47,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/744461690/b269e1807c0e4e2cb6a123f767965bd2/FLAG262150ff7 [2024-11-08 19:40:47,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/744461690/b269e1807c0e4e2cb6a123f767965bd2 [2024-11-08 19:40:47,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:40:47,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:40:47,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:40:47,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:40:47,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:40:47,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:47,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@205812cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47, skipping insertion in model container [2024-11-08 19:40:47,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:47,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:40:47,769 WARN L250 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-85.i[913,926] [2024-11-08 19:40:47,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:40:47,873 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:40:47,898 WARN L250 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-85.i[913,926] [2024-11-08 19:40:47,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:40:47,964 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:40:47,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47 WrapperNode [2024-11-08 19:40:47,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:40:47,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:40:47,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:40:47,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:40:47,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:47,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,031 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-08 19:40:48,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:40:48,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:40:48,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:40:48,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:40:48,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,082 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-11-08 19:40:48,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,100 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:40:48,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:40:48,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:40:48,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:40:48,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (1/1) ... [2024-11-08 19:40:48,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:40:48,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:40:48,164 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-11-08 19:40:48,168 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-11-08 19:40:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:40:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:40:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:40:48,215 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:40:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:40:48,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:40:48,310 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:40:48,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:40:50,426 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:40:50,426 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:40:50,441 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:40:50,441 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:40:50,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:40:50 BoogieIcfgContainer [2024-11-08 19:40:50,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:40:50,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:40:50,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:40:50,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:40:50,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:40:47" (1/3) ... [2024-11-08 19:40:50,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d54d54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:40:50, skipping insertion in model container [2024-11-08 19:40:50,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:40:47" (2/3) ... [2024-11-08 19:40:50,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d54d54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:40:50, skipping insertion in model container [2024-11-08 19:40:50,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:40:50" (3/3) ... [2024-11-08 19:40:50,450 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-85.i [2024-11-08 19:40:50,465 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:40:50,466 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:40:50,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:40:50,542 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;@68db8186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:40:50,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:40:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:40:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 19:40:50,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:40:50,562 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:40:50,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:40:50,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:40:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1085262619, now seen corresponding path program 1 times [2024-11-08 19:40:50,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:40:50,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817593006] [2024-11-08 19:40:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:40:50,586 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-11-08 19:40:50,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:40:50,589 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-11-08 19:40:50,590 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-11-08 19:40:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:51,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:40:51,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:40:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-08 19:40:51,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:40:51,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:40:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817593006] [2024-11-08 19:40:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817593006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:40:51,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:40:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:40:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281898534] [2024-11-08 19:40:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:40:51,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:40:51,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:40:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:40:51,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:40:51,087 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:40:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:40:51,114 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-08 19:40:51,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:40:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-08 19:40:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:40:51,128 INFO L225 Difference]: With dead ends: 119 [2024-11-08 19:40:51,128 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 19:40:51,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-11-08 19:40:51,135 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:40:51,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:40:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 19:40:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 19:40:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:40:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-08 19:40:51,188 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 139 [2024-11-08 19:40:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:40:51,190 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-08 19:40:51,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:40:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-08 19:40:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 19:40:51,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:40:51,194 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:40:51,211 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-08 19:40:51,394 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-11-08 19:40:51,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:40:51,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:40:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2074053391, now seen corresponding path program 1 times [2024-11-08 19:40:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:40:51,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583086797] [2024-11-08 19:40:51,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:40:51,397 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-11-08 19:40:51,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:40:51,431 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-11-08 19:40:51,434 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-11-08 19:40:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:51,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:40:51,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:40:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 553 proven. 45 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2024-11-08 19:40:53,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:40:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 75 proven. 48 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-08 19:40:54,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:40:54,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583086797] [2024-11-08 19:40:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583086797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:40:54,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:40:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-08 19:40:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365369811] [2024-11-08 19:40:54,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:40:54,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:40:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:40:54,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:40:54,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:40:54,475 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-08 19:40:57,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:40:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:40:58,335 INFO L93 Difference]: Finished difference Result 168 states and 236 transitions. [2024-11-08 19:40:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 19:40:58,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 139 [2024-11-08 19:40:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:40:58,339 INFO L225 Difference]: With dead ends: 168 [2024-11-08 19:40:58,339 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 19:40:58,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2024-11-08 19:40:58,341 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 136 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:40:58,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 240 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 19:40:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 19:40:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-11-08 19:40:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 19:40:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2024-11-08 19:40:58,365 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 139 [2024-11-08 19:40:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:40:58,366 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2024-11-08 19:40:58,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-08 19:40:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2024-11-08 19:40:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 19:40:58,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:40:58,372 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 19:40:58,391 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-11-08 19:40:58,573 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-11-08 19:40:58,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:40:58,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:40:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2075900433, now seen corresponding path program 1 times [2024-11-08 19:40:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:40:58,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157295083] [2024-11-08 19:40:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:40:58,576 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-11-08 19:40:58,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:40:58,577 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-11-08 19:40:58,579 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-11-08 19:40:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:58,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 19:40:58,991 INFO L278 TraceCheckSpWp]: Computing forward predicates...