./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_loopvsstraightlinecode_100-while_file-1.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 ecbd2e76b09c20f709f57c97db51ca614252d67d1b8bd7f07a2fbe2befdf8756 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:29:38,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:29:38,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:29:38,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:29:38,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:29:38,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:29:38,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:29:38,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:29:38,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:29:38,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:29:38,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:29:38,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:29:38,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:29:38,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:29:38,813 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:29:38,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:29:38,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:29:38,813 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:29:38,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:29:38,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:29:38,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:29:38,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:29:38,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:29:38,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:29:38,819 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:29:38,819 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:29:38,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:29:38,819 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:29:38,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:29:38,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:29:38,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:29:38,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:29:38,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:29:38,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:29:38,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:29:38,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:29:38,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:29:38,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:29:38,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:29:38,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:29:38,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:29:38,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:29:38,823 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 -> ecbd2e76b09c20f709f57c97db51ca614252d67d1b8bd7f07a2fbe2befdf8756 [2024-11-18 22:29:39,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:29:39,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:29:39,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:29:39,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:29:39,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:29:39,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-1.i [2024-11-18 22:29:40,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:29:40,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:29:40,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-1.i [2024-11-18 22:29:40,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3454d1d/ae0d7d20d5bd4372a22f4e7206b4bee0/FLAG8531bbfe6 [2024-11-18 22:29:40,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3454d1d/ae0d7d20d5bd4372a22f4e7206b4bee0 [2024-11-18 22:29:40,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:29:40,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:29:40,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:29:40,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:29:40,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:29:40,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:29:40" (1/1) ... [2024-11-18 22:29:40,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b4bf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:40, skipping insertion in model container [2024-11-18 22:29:40,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:29:40" (1/1) ... [2024-11-18 22:29:40,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:29:41,047 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_loopvsstraightlinecode_100-while_file-1.i[915,928] [2024-11-18 22:29:41,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:29:41,151 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:29:41,162 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_loopvsstraightlinecode_100-while_file-1.i[915,928] [2024-11-18 22:29:41,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:29:41,248 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:29:41,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41 WrapperNode [2024-11-18 22:29:41,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:29:41,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:29:41,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:29:41,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:29:41,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,307 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2024-11-18 22:29:41,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:29:41,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:29:41,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:29:41,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:29:41,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,344 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-18 22:29:41,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:29:41,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:29:41,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:29:41,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:29:41,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (1/1) ... [2024-11-18 22:29:41,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:29:41,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:29:41,423 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-18 22:29:41,429 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-18 22:29:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:29:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:29:41,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:29:41,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:29:41,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:29:41,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:29:41,540 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:29:41,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:29:41,963 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-18 22:29:41,964 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:29:41,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:29:41,980 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:29:41,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:29:41 BoogieIcfgContainer [2024-11-18 22:29:41,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:29:41,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:29:41,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:29:41,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:29:41,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:29:40" (1/3) ... [2024-11-18 22:29:41,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15874510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:29:41, skipping insertion in model container [2024-11-18 22:29:41,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:41" (2/3) ... [2024-11-18 22:29:41,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15874510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:29:41, skipping insertion in model container [2024-11-18 22:29:41,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:29:41" (3/3) ... [2024-11-18 22:29:41,991 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-1.i [2024-11-18 22:29:42,005 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:29:42,005 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:29:42,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:29:42,068 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;@360896cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:29:42,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:29:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-18 22:29:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-18 22:29:42,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:29:42,090 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:29:42,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:29:42,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:29:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1412415497, now seen corresponding path program 1 times [2024-11-18 22:29:42,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:29:42,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438194614] [2024-11-18 22:29:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:29:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:29:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:29:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-18 22:29:42,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:29:42,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438194614] [2024-11-18 22:29:42,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438194614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:29:42,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:29:42,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:29:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781182435] [2024-11-18 22:29:42,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:29:42,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:29:42,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:29:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:29:42,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:29:42,828 INFO L87 Difference]: Start difference. First operand has 116 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-18 22:29:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:29:42,925 INFO L93 Difference]: Finished difference Result 334 states and 603 transitions. [2024-11-18 22:29:42,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:29:42,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-11-18 22:29:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:29:42,938 INFO L225 Difference]: With dead ends: 334 [2024-11-18 22:29:42,938 INFO L226 Difference]: Without dead ends: 221 [2024-11-18 22:29:42,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:29:42,945 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 105 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:29:42,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 512 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:29:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-18 22:29:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2024-11-18 22:29:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 150 states have (on average 1.4333333333333333) internal successors, (215), 150 states have internal predecessors, (215), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-18 22:29:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 347 transitions. [2024-11-18 22:29:43,004 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 347 transitions. Word has length 213 [2024-11-18 22:29:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:29:43,005 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 347 transitions. [2024-11-18 22:29:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-18 22:29:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 347 transitions. [2024-11-18 22:29:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-18 22:29:43,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:29:43,009 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:29:43,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 22:29:43,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:29:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:29:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1721932938, now seen corresponding path program 1 times [2024-11-18 22:29:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:29:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558109505] [2024-11-18 22:29:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:29:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:29:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:29:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-18 22:29:44,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:29:44,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558109505] [2024-11-18 22:29:44,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558109505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:29:44,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:29:44,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:29:44,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309707449] [2024-11-18 22:29:44,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:29:44,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:29:44,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:29:44,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:29:44,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:29:44,045 INFO L87 Difference]: Start difference. First operand 219 states and 347 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-18 22:29:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:29:44,294 INFO L93 Difference]: Finished difference Result 547 states and 860 transitions. [2024-11-18 22:29:44,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:29:44,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-18 22:29:44,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:29:44,300 INFO L225 Difference]: With dead ends: 547 [2024-11-18 22:29:44,301 INFO L226 Difference]: Without dead ends: 331 [2024-11-18 22:29:44,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:29:44,303 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 82 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:29:44,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 472 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:29:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-18 22:29:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2024-11-18 22:29:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 234 states have (on average 1.4316239316239316) internal successors, (335), 236 states have internal predecessors, (335), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-18 22:29:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 511 transitions. [2024-11-18 22:29:44,362 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 511 transitions. Word has length 214 [2024-11-18 22:29:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:29:44,363 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 511 transitions. [2024-11-18 22:29:44,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-18 22:29:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 511 transitions. [2024-11-18 22:29:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-18 22:29:44,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:29:44,366 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:29:44,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:29:44,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:29:44,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:29:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2114959948, now seen corresponding path program 1 times [2024-11-18 22:29:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:29:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946056057] [2024-11-18 22:29:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:29:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:29:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:29:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 261 proven. 225 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-18 22:29:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:29:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946056057] [2024-11-18 22:29:53,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946056057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:29:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137716607] [2024-11-18 22:29:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:29:53,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:29:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:29:53,782 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-18 22:29:53,783 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-18 22:29:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:29:53,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-18 22:29:53,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:30:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1563 proven. 243 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-11-18 22:30:01,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:30:03,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_31~0 256))) (or (and (= (mod c_~var_1_6~0 256) 0) (<= (+ (mod (+ (* 255 c_~var_1_19~0) (* 255 c_~var_1_20~0) c_~var_1_18~0) 256) 1) .cse0)) (forall ((v_z_15 Int)) (or (< v_z_15 1) (< (mod 100 (+ .cse0 (* (- 1) v_z_15))) (mod c_~var_1_18~0 256)) (< 126 v_z_15))))) is different from false [2024-11-18 22:30:03,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137716607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:30:03,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 22:30:03,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 41 [2024-11-18 22:30:03,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845849494] [2024-11-18 22:30:03,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 22:30:03,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-18 22:30:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:30:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-18 22:30:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2073, Unknown=2, NotChecked=94, Total=2450 [2024-11-18 22:30:03,647 INFO L87 Difference]: Start difference. First operand 327 states and 511 transitions. Second operand has 41 states, 40 states have (on average 3.225) internal successors, (129), 39 states have internal predecessors, (129), 17 states have call successors, (66), 8 states have call predecessors, (66), 14 states have return successors, (66), 17 states have call predecessors, (66), 17 states have call successors, (66) [2024-11-18 22:30:19,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:30:28,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:30:32,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:30:41,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:30:45,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:30:49,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:30:57,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:31:01,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:31:05,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:31:09,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 22:31:15,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]